The following pages link to (Q3957945):
Displaying 7 items.
- Space sweep solves intersection of convex polyhedra (Q759486) (← links)
- Approximating nearest neighbor among triangles in convex position (Q975498) (← links)
- Finding extreme points in three dimensions and solving the post-office problem in the plane (Q1069424) (← links)
- Parallel construction of subdivision hierarchies (Q1124347) (← links)
- Asymptotic speed-ups in constructive solid geometry (Q1894301) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron (Q5060124) (← links)