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 3 items.
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons (Q786507) (← 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)
