Linear-time algorithms for weakly-monotone polygons

DOI10.1016/0925-7721(93)90031-ZzbMath0792.68188MaRDI QIDQ685601

Paul J. Heffernan

Publication date: 7 August 1994

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

triangulationsimple polygonslinear-time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Computational geometry in a curved world
• On geodesic properties of polygons relevant to linear time triangulation
• Triangulating a simple polygon in linear time
• Triangulating a simple polygon
• Triangulation and shape-complexity
• Triangulating Simple Polygons and Equivalent Problems
• Monotone Pieces of Chains
• An Optimal Algorithm for Finding the Kernel of a Polygon

This page was built for publication: Linear-time algorithms for weakly-monotone polygons