Pages that link to "Item:Q6102304"

The following pages link to Efficient computation of the geodesic Voronoi diagram of points in a simple polygon (Q6102304):

Displaying 12 items.

• A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains (Q1386341) (← links)
• Finding constrained and weighted Voronoi diagrams in the plane (Q1388136) (← links)
• Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q1790962) (← links)
• Computing geodesic furthest neighbors in simple polygons (Q1822979) (← links)
• The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces (Q1943631) (← links)
• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (Q2300726) (← links)
• ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
• (Q3221723) (← links)
• Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time (Q3558019) (← links)
• “The big sweep”: On the power of the wavefront approach to Voronoi diagrams (Q5096887) (← links)
• (Q5855454) (← links)
• VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)