The following pages link to (Q3323308):
Displaying 6 items.
- Finding the minimum vertex distance between two disjoint convex polygons in linear time (Q1071519) (← links)
- Finding the closest extreme vertex to a fixed point (Q1199551) (← links)
- Finding Extremal Polygons (Q3221405) (← links)
- Computing the extreme distances between two convex polygons (Q3741079) (← links)
- A linear time algorithm for the computation of some distance functions between convex polygons (Q3991698) (← links)
- (Q4284244) (← links)