Pages that link to "Item:Q1178232"
From MaRDI portal
The following pages link to A new data structure for shortest path queries in a simple polygon (Q1178232):
Displaying 21 items.
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Shortest zookeeper's routes in simple polygons (Q1607077) (← links)
- Computing simple paths from given points inside a polygon (Q1630775) (← links)
- An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Piercing pairwise intersecting geodesic disks by five points (Q2096392) (← links)
- Piercing pairwise intersecting geodesic disks (Q2230402) (← links)
- Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q2291454) (← links)
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (Q2300726) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- ON GEOMETRIC PATH QUERY PROBLEMS (Q4682151) (← links)
- (Q5088992) (← links)
- (Q5115770) (← links)
- On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (Q5116469) (← links)
- (Q5116518) (← links)
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
