Pages that link to "Item:Q1207795"

The following pages link to The furthest-site geodesic Voronoi diagram (Q1207795):

Displaying 29 items.

• The geodesic diameter of polygonal domains (Q368771) (← links)
• Farthest-polygon Voronoi diagrams (Q632728) (← links)
• Blaschke-type theorem and separation of disjoint closed geodesic convex sets (Q662859) (← links)
• Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon (Q679748) (← links)
• A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
• On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
• Facility location on a polyhedral surface (Q1434248) (← links)
• An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons (Q1603488) (← links)
• The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
• Euclidean farthest-point Voronoi diagram of a digital edge (Q2255824) (← links)
• Voronoi diagrams for a moderate-sized point-set in a simple polygon (Q2291454) (← links)
• The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
• Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
• On farthest Voronoi cells (Q2332415) (← links)
• \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q2334499) (← links)
• The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon (Q3132892) (← links)
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057) (← links)
• Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon (Q3578011) (← links)
• (Q4028875) (← links)
• FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS (Q4818559) (← links)
• On the Farthest Line-Segment Voronoi Diagram (Q4909535) (← links)
• (Q5088939) (← links)
• (Q5115770) (← links)
• GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
• Guarding Exterior Region of a Simple Polygon (Q5452157) (← links)
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
• Kinetic Geodesic Voronoi Diagrams in a Simple Polygon (Q6057802) (← 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)