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

Authors:
Boris Aronov;Mark de Berg;Chris Gray
Affiliations:
Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY 11201-3840, USA;Department of Computing Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Department of Computing Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Computational Geometry: Theory and Applications
Year:
2008

Citing 12
Cited 4

Ray shooting and parametric search

SIAM Journal on Computing
Range searching in low-density environments

Information Processing Letters
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems

SIAM Journal on Computing
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

Computational Geometry: Theory and Applications
Ray shooting and lines in space

Handbook of discrete and computational geometry
Ray Shooting, Depth Orders and Hidden Surface Removal

Ray Shooting, Depth Orders and Hidden Surface Removal
Range Searching and Point Location among Fat Objects

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Vertical ray shooting for fat objects

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Ray shooting amid balls, farthest point from a line, and range emptiness searching

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Vertical ray shooting and computing depth orders for fat objects

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximate range searching using binary space partitions

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Decompositions and Boundary Coverings of Non-convex Fat Polyhedra

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Decompositions and boundary coverings of non-convex fat polyhedra

Computational Geometry: Theory and Applications
A local search algorithm for ray-convex polyhedron intersection

Computational Optimization and Applications
Triangulating and guarding realistic polygons

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in R^3. The data structure uses O(n^2^+^@e) storage and preprocessing time, and queries can be answered in O(log^2n) time. A trade-off between storage and query time is also possible: for any m with n