Linear-time algorithms for weakly-monotone polygons
From MaRDI portal
Publication:685601
DOI10.1016/0925-7721(93)90031-ZzbMath0792.68188MaRDI QIDQ685601
Publication date: 7 August 1994
Published in: Computational Geometry (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
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