A fast Las Vegas algorithm for triangulating a simple polygon

Authors:
K. L. Clarkson;R. E. Tarjan;C. J. Van Wyk
Affiliations:
AT&T Bell Laboratories, Murray Hill, New Jersey;Department of Computer Science, Princeton University, Princeton, New Jersey and AT&T Bell Laboratories, Murray Hill, New Jersey;AT&T Bell Laboratories, Murray Hill, New Jersey
Venue:
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Year:
1988

Citing 7
Cited 6

Computational geometry: an introduction

Computational geometry: an introduction
Sorting Jordan sequences in linear time using level-linked search trees

Information and Control
An O (n log log n)-time algorithm for triangulating a simple polygon

SIAM Journal on Computing
Applications of random sampling in computational geometry, II

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Applications of random sampling in computational geometry, II

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Triangulation and shape-complexity

ACM Transactions on Graphics (TOG)
Triangulating Simple Polygons and Equivalent Problems

ACM Transactions on Graphics (TOG)

Computational geometry column

ACM SIGACT News
Applications of random sampling in computational geometry, II

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A deterministic algorithm for partitioning arrangements of lines and its application

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Compliant motion in a simple polygon

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Polygon triangulation in O(n log log n) time with simple data-structures

SCG '90 Proceedings of the sixth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm that triangulates a simple polygon on n vertices in &Ogr;(n log* n) expected time. The algorithm uses random sampling on the input, and its running time does not depend on any assumptions about a probability distribution from which the polygon is drawn.