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

Popular posts from this blog

user interface - how to replace an ongoing process of image capture from another process call over the same ImageLabel in python's GUI TKinter -

javascript - Using jquery append to add option values into a select element not working -

javascript - Restarting Supervisor and effect on FlaskSocketIO -