# A fast las vegas algorithm for triangulating a simple polygon

## Authors

Article

- First Online:

- Received:
- Revised:

DOI: 10.1007/BF02187741

- Cite this article as:
- Clarkson, K.L., Tarjan, R.E. & Van Wyk, C.J. Discrete Comput Geom (1989) 4: 423. doi:10.1007/BF02187741

- 18 Citations
- 123 Views

## Abstract

We present a randomized algorithm that triangulates a simple polygon on*n* vertices in*O*(*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.

## Copyright information

© Springer-Verlag New York Inc. 1989