Pages that link to "Item:Q1822979"

The following pages link to Computing geodesic furthest neighbors in simple polygons (Q1822979):

Displaying 19 items.

• Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
• Blaschke-type theorem and separation of disjoint closed geodesic convex sets (Q662859) (← links)
• A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
• Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
• Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
• Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
• The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
• Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
• Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
• Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
• The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
• Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
• PARETO ENVELOPES IN SIMPLE POLYGONS (Q3070044) (← 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)
• (Q5088939) (← links)
• Guarding Exterior Region of a Simple Polygon (Q5452157) (← links)
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
• An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)