An "Event queue", which stores the vertices in lexicographic order. Used to determine the next point the sweepline should stop at.
An event on the Event queue.
A doubly-linked-list that represents how the intersections of the polygon's edges are connected.
The sweepline is sorted by the height of the edges' intersections with the sweepline. If these are equal, the lines are sorted by slope. If these are also equal, the lines are consistently ordered by their [[SweeplineEdge.id | IDs]].
renderTo helper function. "Cuts" two edges at the intersection point, adds the new directed edges according to the simplification algorithm.
The first edge to cut.
The second edge to cut.
Orders two points lexicographically based on the coordinates on indices 0 and 1. Uses the IDs of the vertices to order them consistently if their coordinates are identical.
The first point to order.
The second point to order.
A positive, zero or negative number depending on whether a > b, a = b or a < b.
Renders a polytope into a scene. Implements the Bentley-Ottmann algorithm as well as a simplification algorithm to triangulate general polygons.
Generated using TypeDoc, the 1/31/2021 at 6:18:56 AM
Class with the needed methods to render a polytope.