Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
From MaRDI portal
Recommendations
- The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
- Higher-order Voronoi diagrams on triangulated surfaces
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- On the geodesic Voronoi diagram of point sites in a simple polygon
Cited in
(13)- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- The higher-order Voronoi diagram of line segments
- Higher order city Voronoi diagrams
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- On higher order Voronoi diagrams of line segments
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
- Shortest rectilinear path queries to rectangles in a rectangular domain
- Dynamic data structures for \(k\)-nearest neighbor queries
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- Higher-order Voronoi diagrams on triangulated surfaces
This page was built for publication: Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741826)