Pages that link to "Item:Q728493"
From MaRDI portal
The following pages link to A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493):
Displaying 8 items.
- A local search algorithm for ray-convex polyhedron intersection (Q429472) (← links)
- A simple linear algorithm for intersecting convex polygons (Q1822240) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron (Q5060124) (← links)
- (Q5075809) (← links)
- An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions (Q5112542) (← links)
- (Q5368724) (← links)
- Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner \((p, q)\)-theorem (Q5881548) (← links)