Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

DOI10.1016/J.COMGEO.2007.10.006MaRDI QIDQ934024zbMATH OpenOpenAlexFDO

Authors Boris Aronov, Chris Gray, Mark de Berg

Publication date 29 July 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2007.10.006

zbMATH Keywords

intersection searchinggeometric data structuresray shootingfat objects

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Vertical ray shooting for fat objects
• scientific article; zbMATH DE number 437551
• Linear data structures for fast ray-shooting amidst convex polyhedra
• Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
• Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions

Cites work

• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 1182925 (Why is no real title available?)
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Fast detection of polyhedral intersection
• Linear size binary space partitions for uncluttered scenes
• Lines in space: Combinatorics and algorithms
• New lower bounds for Hopcroft's problem
• On range searching with semialgebraic sets
• Range Searching and Point Location among Fat Objects
• Range searching in low-density environments
• Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
• Ray Shooting and Parametric Search
• Ray shooting amid balls, farthest point from a line, and range emptiness searching
• Ray shooting and stone throwing
• Ray shooting on triangles in 3-space
• Ray shooting, depth orders and hidden surface removal
• The complexity of the free space for motion planning amidst fat obstacles
• Vertical ray shooting and computing depth orders for fat objects
• Vertical ray shooting for fat objects

Cited in

(11)

• Algorithms for ray-shooting and intersection searching
• A local search algorithm for ray-convex polyhedron intersection
• On ray shooting for triangles in 3-space and related problems
• scientific article; zbMATH DE number 1786508 (Why is no real title available?)
• Linear data structures for fast ray-shooting amidst convex polyhedra
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Decompositions and boundary coverings of non-convex fat polyhedra
• Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
• Vertical ray shooting for fat objects
• A fast method for obtaining convex combination coefficients
• scientific article; zbMATH DE number 437551 (Why is no real title available?)

This page was built for publication: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

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