The following pages link to (Q2721968):
Displaying 10 items.
- Computing the Fréchet distance with a retractable leash (Q312142) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Kinetic hanger (Q1029070) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- Tight degree bounds for pseudo-triangulations of points (Q1873151) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- (Q5005158) (← links)
- (Q5088951) (← links)
- (Q5088955) (← links)
- An optimal algorithm to compute the inverse beacon attraction region (Q5115823) (← links)
