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.
Original language | English (US) |
---|---|
Pages (from-to) | 220-230 |
Number of pages | 11 |
Journal | IEEE Transactions on Industry Applications |
Volume | 27 |
Issue number | 1 pt 1 |
State | Published - Jan 1991 |
Externally published | Yes |
Event | 1989 Industry Applications Society Annual Meeting - San Diego, CA, USA Duration: Oct 1 1989 → Oct 5 1989 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
- Control and Systems Engineering
- Industrial and Manufacturing Engineering