# zbMATH — the first resource for mathematics

Anthropomorphic polygons. (English) Zbl 0742.52014
Let $$P$$ be a simple polygon in $$E^ 2$$. The author shows that certain types of $$P$$ can be triangulated in $$O(n)$$ time. According to the note added in proof, it has since been shown that an arbitrary $$P$$ can be triangulated in linear time.

##### MSC:
 52B55 Computational aspects related to convexity 68W10 Parallel algorithms in computer science 68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
Full Text: