Pages that link to "Item:Q582099"

The following pages link to Computing the geodesic center of a simple polygon (Q582099):

Displaying 38 items.

• The geodesic diameter of polygonal domains (Q368771) (← links)
• Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
• Computing the geodesic center of a simple polygon (Q582099) (← links)
• Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
• Blaschke-type theorem and separation of disjoint closed geodesic convex sets (Q662859) (← links)
• Diffuse reflection radius in a simple polygon (Q727965) (← links)
• A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
• Computing the link center of a simple polygon (Q1104086) (← links)
• On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
• Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
• An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
• The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
• On the ball spanned by balls (Q1264087) (← links)
• Centers of sets of pixels (Q1570843) (← links)
• The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
• Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
• Multiple-guard kernels of simple polygons (Q1818909) (← links)
• Computing geodesic furthest neighbors in simple polygons (Q1822979) (← links)
• Piercing pairwise intersecting geodesic disks by five points (Q2096392) (← links)
• The polygon burning problem (Q2154090) (← links)
• Piercing pairwise intersecting geodesic disks (Q2230402) (← 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)
• Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
• Packing and covering with balls on Busemann surfaces (Q2358828) (← links)
• PARETO ENVELOPES IN SIMPLE POLYGONS (Q3070044) (← links)
• Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon (Q3578011) (← links)
• GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON (Q4650081) (← links)
• Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
• (Q5088939) (← links)
• An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146) (← links)
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
• Kinetic Geodesic Voronoi Diagrams in a Simple Polygon (Q6057802) (← links)
• Clique-based separators for geometric intersection graphs (Q6103521) (← links)
• An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
• Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)
• On flipping the Fréchet distance (Q6647773) (← links)