Pages that link to "Item:Q1175781"

The following pages link to Computing external farthest neighbors for a simple polygon (Q1175781):

Displaying 3 items.

• Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
• Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
• Guarding Exterior Region of a Simple Polygon (Q5452157) (← links)