A new data structure for shortest path queries in a simple polygon
From MaRDI portal
(Redirected from Publication:1178232)
Recommendations
Cites work
- An optimal visibility graph algorithm for triangulated simple polygons
- scientific article; zbMATH DE number 432762 (Why is no real title available?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Maintenance of configurations in the plane
- Optimal shortest path queries in a simple polygon
Cited in
(28)- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Ray shooting in polygons using geodesic triangulations
- Shortest zookeeper's routes in simple polygons
- Computing simple paths from given points inside a polygon
- Optimal shortest path queries in a simple polygon
- An O\((n\log n)\) algorithm for the zoo-keeper's problem
- Efficient piecewise-linear function approximation using the uniform metric
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Piercing pairwise intersecting geodesic disks by five points
- Piercing pairwise intersecting geodesic disks
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- On Romeo and Juliet problems: minimizing distance-to-sight
- Minimum weight pseudo-triangulations
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
- A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
- ON GEOMETRIC PATH QUERY PROBLEMS
- scientific article; zbMATH DE number 742973 (Why is no real title available?)
- A divide-and-conquer algorithm for two-point L₁ shortest path queries in polygonal domains
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- On Romeo and Juliet problems: minimizing distance-to-sight
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- Piercing unit geodesic disks
- A new algorithm for Euclidean shortest paths in the plane
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
This page was built for publication: A new data structure for shortest path queries in a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178232)
