Triangulating a simple polygon in linear time

Research output: Contribution to journalArticle

49 Scopus citations

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 languageEnglish (US)
Pages (from-to)220-230
Number of pages11
JournalIEEE Transactions on Industry Applications
Volume27
Issue number1 pt 1
StatePublished - Jan 1 1991

All Science Journal Classification (ASJC) codes

  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Triangulating a simple polygon in linear time'. Together they form a unique fingerprint.

  • Cite this