Pages that link to "Item:Q2291454"

The following pages link to Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q2291454):

Displaying 16 items.

• Link distance and shortest path problems in the plane (Q634253) (← links)
• On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
• The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
• The Hausdorff Voronoi diagram of point clusters in the plane (Q1882526) (← links)
• Piercing pairwise intersecting geodesic disks (Q2230402) (← links)
• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (Q2300726) (← links)
• The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
• The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon (Q3132892) (← links)
• Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q4580129) (← links)
• Computational Science and Its Applications – ICCSA 2004 (Q5901280) (← links)
• Voronoi diagrams for convex polygon-offset distance functions (Q5932811) (← links)
• Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology (Q5941487) (← links)
• Kinetic Geodesic Voronoi Diagrams in a Simple Polygon (Q6057802) (← links)
• Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)
• An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
• Farthest-point Voronoi diagrams in the presence of rectangular obstacles (Q6174812) (← links)