The following pages link to (Q4028879):
Displayed 5 items.
- Computing the longest diagonal of a simple polygon (Q917298) (← links)
- Optimal time bounds for some proximity problems in the plane (Q1198024) (← links)
- Computing the shortest diagonal of a monotone polygon in linear time (Q1198084) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- An optimal algorithm for finding the separation of simple polygons (Q5060097) (← links)