A local search algorithm for ray-convex polyhedron intersection
From MaRDI portal
Publication:429472
DOI10.1007/S10589-010-9354-2zbMATH Open1268.90030OpenAlexW2043498431MaRDI QIDQ429472FDOQ429472
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
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
- Title not available (Why is that?)
- The quickhull algorithm for convex hulls
- Computing Dirichlet Tessellations in the Plane
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ray shooting on triangles 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
- Octrees with near optimal cost for ray-shooting
- Title not available (Why is that?)
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Cited In (4)
- LOCAL ROBUSTNESS AND ITS APPLICATION TO POLYHEDRAL INTERSECTION
- 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
- Algorithms for ray-shooting and intersection searching
Uses Software
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)