Triangulation and Shape-Complexity

@article{Chazelle1984TriangulationAS,
  title={Triangulation and Shape-Complexity},
  author={Bernard Chazelle and Janet Incerpi},
  journal={ACM Trans. Graph.},
  year={1984},
  volume={3},
  pages={135-152}
}
This paper describes a new method for triangulating a simple n-sided polygon. The algorithm runs in time O(n log s), with s _< n. The quantity s measures the sinuosity of the polygon, that is, the number of times the boundary alternates between complete spirals of opposite orientation. The value of s is in practice a very small constant, even for extremely winding polygons. Our algorithm is the first method whose performance is linear in the number of vertices, up to within a factor that… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 62 extracted citations

Similar Papers

Loading similar papers…