Revision as of 17:43, 5 March 2018 edit Nbro (talk \| contribs) Extended confirmed users 3,319 edits →Data structures ← Previous edit		Revision as of 17:43, 5 March 2018 edit undo Nbro (talk \| contribs) Extended confirmed users 3,319 edits →Data structures Next edit →
Line 18: ==Data structures== {{Confusing section\|reason=it's not ~~clear~~explained what internal and leaf nodes of the binary search tree represent. How are line segments compared to each other, while inserting, deleting or finding the predecessor or successor of a line segment? What makes a line segment the predecessor and successor of another line segment?\|small='no'}} In order to efficiently maintain the intersection points of the sweep line ''L'' with the input line segments and the sequence of future events, the Bentley–Ottmann algorithm maintains two [[data structure]]s:

Bentley–Ottmann algorithm: Difference between revisions