Pages that link to "Item:Q1176324"
From MaRDI portal
The following pages link to Triangulating a simple polygon in linear time (Q1176324):
Displayed 14 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Distance-sensitive planar point location (Q283883) (← links)
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem (Q340521) (← links)
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- On a class of \(O(n^2)\) problems in computational geometry (Q419363) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Representing a functional curve by curves with fewer peaks (Q635753) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Algorithms for deciding the containment of polygons (Q671621) (← links)
- An optimal algorithm for finding the edge visibility polygon under limited visibility (Q673918) (← links)