Improved dynamic geodesic nearest neighbor searching in a simple polygon
From MaRDI portal
Publication:5115770
Recommendations
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Dynamic geodesic convex hulls in dynamic simple polygons
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
Cites work
- scientific article; zbMATH DE number 1555916 (Why is no real title available?)
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- A new data structure for shortest path queries in a simple polygon
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Applications of random sampling in computational geometry. II
- Decomposable searching problems I. Static-to-dynamic transformation
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Dynamic half-space range reporting and its applications
- Geometric approximation algorithms
- Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Maintenance of geometric extrema
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
- Optimal Point Location in a Monotone Subdivision
- Optimal shortest path queries in a simple polygon
- Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
- Relative (p, )-approximations in geometry
- Reporting points in halfspaces
- The furthest-site geodesic Voronoi diagram
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
Cited in
(9)- Exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- Computing geodesic furthest neighbors in simple polygons
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
- On approximate geodesic-distance queries amid deforming point clouds
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Dynamic data structures for \(k\)-nearest neighbor queries
- scientific article; zbMATH DE number 5046292 (Why is no real title available?)
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
This page was built for publication: Improved dynamic geodesic nearest neighbor searching in a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115770)
