Anthropomorphic Polygons

DOI10.2307/2324033MaRDI QIDQ3984347zbMATH OpenOpenAlexFDO

Authors Godfried Toussaint

Publication date 27 June 1992

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2324033

zbMATH Keywords

anthropomorphic polygoncomputational geometryearmouthsimple polygontriangulation

Mathematics Subject Classification ID

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

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1182916
• Polygones
• Polygones
• Pantographic polygons
• A Panoply of Polygons
• scientific article; zbMATH DE number 1077072
• Shapes of polygons
• scientific article; zbMATH DE number 3944707
• Polytopes
• scientific article; zbMATH DE number 1368684

Cited in

(2)

• Computing bushy and thin triangulations
• The complex of non-crossing diagonals of a polygon

This page was built for publication: Anthropomorphic Polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984347)