Linear-time algorithms for weakly-monotone polygons
From MaRDI portal
Publication:685601
DOI10.1016/0925-7721(93)90031-ZzbMATH Open0792.68188MaRDI QIDQ685601FDOQ685601
Authors: Paul J. Heffernan 
Publication date: 7 August 1994
Published in: Computational Geometry (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Triangulating a simple polygon in linear time
- Triangulating a simple polygon
- Triangulation and shape-complexity
- Triangulating Simple Polygons and Equivalent Problems
- On geodesic properties of polygons relevant to linear time triangulation
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Computational geometry in a curved world
- Title not available (Why is that?)
- Monotone Pieces of Chains
Cited In (11)
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
- Computing the shortest diagonal of a monotone polygon in linear time
- Recognizing weakly simple polygons
- On geodesic properties of polygons relevant to linear time triangulation
- Triangulating a simple polygon in linear time
- A linear time algorithm to remove winding of a simple polygon
- Detecting weakly simple polygons
- Simplified linear-time Jordan sorting and polygon clipping
- A new linear algorithm for triangulating monotone polygons
- A new triangulation-linear class of simple polygons
- A linear-time construction of Reuleaux polygons
This page was built for publication: Linear-time algorithms for weakly-monotone polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685601)
