A local search algorithm for ray-convex polyhedron intersection
type: Item
instance of: scholarly article
title: A local search algorithm for ray-convex polyhedron intersection
zbMATH Open document ID: 1268.90030
author: Bernardo Llanas
author: Francisco Javier Sáinz
published in: Computational Optimization and Applications
publication date: 2012-06-19T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6048068
zbMATH Keywords: ray-convex polyhedron intersection
zbMATH Keywords: local search algorithms
zbMATH Keywords: visibility
zbMATH Keywords: high combinatorial complexity
describes a project that uses: Qhull
describes a project that uses: GTEngine
MaRDI profile type: Publication
full work available at URL: s10589-010-9354-2
OpenAlex ID: W2043498431
cites work: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
cites work: The quickhull algorithm for convex hulls
cites work: Octrees with near optimal cost for ray-shooting
cites work: Expected time analysis for Delaunay point location
cites work: Q4038707
cites work: Q5687941
cites work: Q4344022
cites work: Computing Dirichlet Tessellations in the Plane
cites work: Q4401003
cites work: Geometry and search in motion planning.
cites work: An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
cites work: Minimum distance between the faces of two convex polyhedra: A sufficient condition
cites work: Ray shooting on triangles in 3-space
DOI: 10.1007/S10589-010-9354-2
Recommended article: A complete and efficient algorithm for the intersection of a general and a convex polyhedron
Recommended article: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
Recommended article: Q4256651
Recommended article: Optimal detection of intersections between convex polyhedra
Recommended article: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Recommended article: A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
Recommended article: Q5368724
Recommended article: Algorithms for ray-shooting and intersection searching
Recommended article: A new linear algorithm for intersecting convex polygons
Recommended article: The intersection searching problem for c-oriented polygons
description: scientific article; zbMATH DE number 6048068