Algorithm -- Monotone Decomposition -- Data Structures

• to keep the input (P) and the output (monotone decomposition of P)
• use doubly-connected edge list D
• to visit the vertices in correct order
• a priority queue Q, where the priority of a vertex is its y-coordinate
• we often need the edge to the left of some vertex and its helper
• we keep T, a dynamic binary search tree of edges intersecting the sweep line
• with each edge we store its helper

back    next