Nearest neighbor searching in a dynamic simple polygon
From MaRDI portal
Cites work
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Applications of a new space-partitioning technique
- Decomposable searching problems I. Static-to-dynamic transformation
- Dynamic data structures for \(k\)-nearest neighbor queries
- Dynamic geodesic convex hulls in dynamic simple polygons
- Dynamic geometric data structures via shallow cuttings
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- Dynamic Trees and Dynamic Point Location
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- Maintaining the visibility graph of a dynamic simple polygon
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
- Optimal partition trees
- Optimal Search in Planar Subdivisions
- Optimal shortest path queries in a simple polygon
- Ray shooting in polygons using geodesic triangulations
- Relative convex hulls in semi-dynamic arrangements
- Shooting permanent rays among disjoint polygons in the plane
- The design of dynamic data structures
- Triangulating a simple polygon in linear time
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
This page was built for publication: Nearest neighbor searching in a dynamic simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312683)
