Notes and Comments -- Generalizations and Improvements

• the algorithm we have shown also works for polygons with holes


• it even works for planar subdivisions


• faster triangulation algorithms were developed -- O(n log log n) and O(n log* n)
• in 1990 a very complicated deterministic linear (O(n)) polygon triangulation algorithm was given by Chazelle

back    next