Polygon triangulation in O(nn) time with simple data structures
From MaRDI portal
Publication:1189285
Recommendations
Cites work
- scientific article; zbMATH DE number 3825165 (Why is no real title available?)
- scientific article; zbMATH DE number 193423 (Why is no real title available?)
- A fast Las Vegas algorithm for triangulating a simple polygon
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Simplified linear-time Jordan sorting and polygon clipping
- Sorting jordan sequences in linear time using level-linked search trees
- Triangulating Simple Polygons and Equivalent Problems
- Triangulating a simple polygon
- Triangulating a simple polygon in linear time
- Triangulation and shape-complexity
Cited in
(15)- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Spiral serpentine polygonization of a planar point set
- Integral points in rational polygons: a numerical semigroup approach
- Cartographic line simplification and polygon CSG formulae in O(n^* n) time
- Polygon triangulation: Efficiency and minimality
- Triangulating a simple polygon in linear time
- Computing hereditary convex structures
- Three problems about simple polygons
- Triangulation and shape-complexity
- Triangulating Simple Polygons and Equivalent Problems
- An O(log log n) algorithm to compute the kernel of a polygon
- scientific article; zbMATH DE number 753970 (Why is no real title available?)
- TRIANGULATING DISJOINT JORDAN CHAINS
- Time-space trade-offs for triangulating a simple polygon
This page was built for publication: Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189285)
