A fast las vegas algorithm for triangulating a simple polygon
- First Online:
- Cite this article as:
- Clarkson, K.L., Tarjan, R.E. & Van Wyk, C.J. Discrete Comput Geom (1989) 4: 423. doi:10.1007/BF02187741
- 123 Views
We present a randomized algorithm that triangulates a simple polygon onn vertices inO(n log*n) expected time. The averaging in the analysis of running time is over the possible choices made by the algorithm; the bound holds for any input polygon.