Pages that link to "Item:Q5060124"
From MaRDI portal
The following pages link to A complete and efficient algorithm for the intersection of a general and a convex polyhedron (Q5060124):
Displaying 17 items.
- A local search algorithm for ray-convex polyhedron intersection (Q429472) (← links)
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- Space sweep solves intersection of convex polyhedra (Q759486) (← links)
- Convex polyhedral chains: A representation for geometric data (Q1118964) (← links)
- A general algorithm for determining all essential solutions and inequalities for any convex polyhedron (Q1339125) (← links)
- An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane (Q1806579) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- A robust segment/triangle intersection algorithm for interference tests. Efficiency study (Q2269834) (← links)
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments (Q2371337) (← links)
- Intersecting quadrics: an efficient and exact implementation (Q2507161) (← links)
- ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES (Q2970416) (← links)
- (Q4256651) (← links)
- An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons (Q4876693) (← links)
- The Geometry of the Intersection of Voxel Spaces (Q4917107) (← links)
- An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions (Q5112542) (← links)
- Intersecting quadrics (Q5361697) (← links)
- (Q5368724) (← links)
