A local search algorithm for ray-convex polyhedron intersection

DOI10.1007/S10589-010-9354-2MaRDI QIDQ429472zbMATH OpenOpenAlexFDO

Authors Bernardo Llanas, Francisco Javier Sáinz

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)

Recommendations

• A complete and efficient algorithm for the intersection of a general and a convex polyhedron
• An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
• scientific article; zbMATH DE number 1318519
• Optimal detection of intersections between convex polyhedra
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
• scientific article; zbMATH DE number 6789228
• Algorithms for ray-shooting and intersection searching
• A new linear algorithm for intersecting convex polygons
• The intersection searching problem for c-oriented polygons

Cites work

• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• scientific article; zbMATH DE number 1032051 (Why is no real title available?)
• scientific article; zbMATH DE number 1182906 (Why is no real title available?)
• scientific article; zbMATH DE number 960150 (Why is no real title available?)
• An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
• Computing Dirichlet Tessellations in the Plane
• Expected time analysis for Delaunay point location
• Geometry and search in motion planning.
• Minimum distance between the faces of two convex polyhedra: A sufficient condition
• Octrees with near optimal cost for ray-shooting
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Ray shooting on triangles in 3-space
• The quickhull algorithm for convex hulls

Cited in

(4)

• Algorithms for ray-shooting and intersection searching
• LOCAL ROBUSTNESS AND ITS APPLICATION TO POLYHEDRAL INTERSECTION
• A fast method for obtaining convex combination coefficients
• A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)

Describes a project that uses

Uses Software

• Qhull
• GTEngine

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429472)