Three-dimensional object recognition
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Robot Motion Planning
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition
Journal of Global Optimization
Geometric Tools for Computer Graphics
Geometric Tools for Computer Graphics
Efficient collision detection for animation and robotics
Efficient collision detection for animation and robotics
Expected time analysis for Delaunay point location
Computational Geometry: Theory and Applications
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Computational Geometry: Theory and Applications
Octrees with near optimal cost for ray-shooting
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
In this paper we present a new algorithm (LSABV) for determining the intersection between a ray and a convex polyhedron (RCPI) in a fast way. LSABV is based on local search and the concept of visibility. LSABV requires only the boundary description of the polyhedron and it does not need additional data structures. Numerical experiments show that LSABV is faster than Haines's algorithm in the case of polyhedra with moderate or large number of faces.