Pages that link to "Item:Q1386341"
From MaRDI portal
The following pages link to A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains (Q1386341):
Displaying 14 items.
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Short trees in polygons (Q1348253) (← 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)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
- (Q5115770) (← links)
- (Q5116518) (← links)
- GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon (Q6057802) (← links)
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon (Q6102304) (← links)
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
