Linear-time algorithms for weakly-monotone polygons
From MaRDI portal
Publication:685601
Recommendations
Cites work
- scientific article; zbMATH DE number 3825165 (Why is no real title available?)
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Computational geometry in a curved world
- Monotone Pieces of Chains
- On geodesic properties of polygons relevant to linear time triangulation
- Triangulating Simple Polygons and Equivalent Problems
- Triangulating a simple polygon
- Triangulating a simple polygon in linear time
- Triangulation and shape-complexity
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)