A local search algorithm for ray-convex polyhedron intersection

DOI10.1007/s10589-010-9354-2zbMath1268.90030OpenAlexW2043498431MaRDI QIDQ429472

Francisco Javier Sáinz, Bernardo Llanas

Publication date: 19 June 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-010-9354-2

zbMATH Keywords

visibilitylocal search algorithmshigh combinatorial complexityray-convex polyhedron intersection

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (2)

A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections) ⋮ A fast method for obtaining convex combination coefficients

Uses Software

• Qhull
• GTEngine

Cites Work

• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Geometry and search in motion planning.
• Minimum distance between the faces of two convex polyhedra: A sufficient condition
• An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
• Expected time analysis for Delaunay point location
• Ray shooting on triangles in 3-space
• Octrees with near optimal cost for ray-shooting
• Computing Dirichlet Tessellations in the Plane
• The quickhull algorithm for convex hulls
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A local search algorithm for ray-convex polyhedron intersection