computational geometry - Adding diagonal while partitioning polygon represented in DCEL in O(1) time -
considering algorithm partition simple polygone monotone pieces lee , preparata read adding every new diagonal can done in o(1) time if our polygon represented in dcel. can't figure out how can done in time.
i think need change face o(n) halfedges. , have 1 diagonal, insertion takes o(n).
Comments
Post a Comment