Pages that link to "Item:Q1071519"
From MaRDI portal
The following pages link to Finding the minimum vertex distance between two disjoint convex polygons in linear time (Q1071519):
Displaying 7 items.
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons (Q786507) (← links)
- A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram (Q863827) (← links)
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057) (← links)
- A linear time algorithm for the computation of some distance functions between convex polygons (Q3991698) (← links)
- An optimal algorithm for finding the separation of simple polygons (Q5060097) (← links)