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 1 1991 |
All Science Journal Classification (ASJC) codes
- Engineering (miscellaneous)
- Electrical and Electronic Engineering