Polygon Triangulation
Daniel Vlasic
Algorithm -- Monotone Decomposition -- Adding Diagonals
-
to partition P into y-monotone pieces, get rid of
split and merge vertices
-
add a diagonal going upward from each split vertex
-
add a diagonal going downward from each merge vertex
-
where does the other end of the diagonal go?
-
to some nearby vertex we can connect to
-
to keep track of those nearby vertices, we introduce extra
information for each edge ej
-
let helper(ej) be the lowest vertex
above the sweepline such that the horizontal segment connecting the vertex
to ej lies inside P
back next