Triangulating a simple polygon in linear time

Authors:
B. Chazelle
Affiliations:
Dept. of Comput. Sci., Princeton Univ., NJ, USA
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 5

Optimal Algorithms for Two-Guard Walkability of Simple Polygons

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Multi-robot exploration of an unknown environment, efficiently reducing the odometry error

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

Computational Geometry: Theory and Applications
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
Approximate guarding of monotone and rectilinear polygons

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A linear-time deterministic algorithm for triangulating a simple polygon is developed. The algorithm is elementary in that it does not require the use of any complicated data structures; in particular, it does not need dynamic search trees, finger trees, or fancy point location structures.