Pages that link to "Item:Q3697818"
From MaRDI portal
The following pages link to A linear algorithm for determining the separation of convex polyhedra (Q3697818):
Displaying 35 items.
- Outlier respecting points approximation (Q517798) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies (Q695915) (← 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)
- Computational geometry in a curved world (Q911324) (← links)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- Approximating nearest neighbor among triangles in convex position (Q975498) (← links)
- Two alternatives for the cubic algorithm (Q1095036) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- Parallel construction of subdivision hierarchies (Q1124347) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- On determining optimal strategies in pursuit games in the plane (Q1269731) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- Finding the projection on a polytope: An iterative method (Q1352784) (← links)
- An output sensitive algorithm for discrete convex hulls (Q1388138) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- A neural network measuring the intersection of \(m\)-dimensional convex polyhedra (Q1893014) (← links)
- Piecewise linear paths among convex obstacles (Q1894717) (← links)
- On separating points by lines (Q1985301) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Dynamic minimum bichromatic separating circle (Q2424884) (← links)
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. (Q2482906) (← links)
- Parallel collision detection between moving robots for practical motion planning (Q2745513) (← links)
- Computation of penetration between smooth convex objects in three-dimensional space (Q4348622) (← links)
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (Q4513199) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS (Q4682203) (← links)
- On Ray Shooting for Triangles in 3-Space and Related Problems (Q5092511) (← links)