A fast las vegas algorithm for triangulating a simple polygon
- First Online:
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.
Unable to display preview. Download preview PDF.
- [ACG]M. J. Atallah, R. Cole, and M. T. Goodrich, Cascading divide-and-conquer: a technique for designing parallel algorithms,Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987, pp. 151–160.Google Scholar
- [C2]K. L. Clarkson, Applications of random sampling in computational geometry, II,Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988, pp. 1–11.Google Scholar
- [CCT]K. L. Clarkson, R. Cole, and R. E. Tarjan, private communication.Google Scholar
- [CS]K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II,Discrete and Computational Geometry, this issue, 387–421.Google Scholar
- [CTV]K. L. Clarkson, R. E. Tarjan, and C. J. Van Wyk, A fast Las Vegas algorithm for triangulating a simple polygon,Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988, pp. 18–22.Google Scholar
- [ES]P. Erdos and J. Spencer,Probabilistic Methods in Combinatorics, Academic Press, New York, 1974.Google Scholar
- [FNTV]K. Y. Fung, T. M. Nicholl, R. E. Tarjan, and C. J. Van Wyk, Simplified linear-time Jordan sorting and polygon clipping,ACM Transactions on Graphics, submitted.Google Scholar