An output-complexity-sensitive polygon triangulation algorithm

@inproceedings{Toussaint1990AnOP,
  title={An output-complexity-sensitive polygon triangulation algorithm},
  author={Godfried T. Toussaint},
  year={1990}
}
This paper describes a new algorithm for triangulating a simple n-sided polygon. The algorithm runs in time O(n(1+t0)), with t0< n. The quantity t0measures theshape-complexityof thetriangulationdelivered by the algorithm. More precisely t0is the number of triangles contained in the triangulation obtained that share zero edges with the input polygon and is, furthermore, related to the shape- complexity of theinputpolygon. Although the worst-case complexity of the algorithm is O(n2), for several… CONTINUE READING