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

B. Aronov, M. Berg, de, C.M. Gray

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)

Abstract

We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in . The data structure uses O(n2+e) storage and preprocessing time, and queries can be answered in O(log2n) time. A trade-off between storage and query time is also possible: for any m with n
Original languageEnglish
Pages (from-to)68-76
JournalComputational Geometry
Volume41
Issue number1-2
DOIs
Publication statusPublished - 2008

Fingerprint

Dive into the research topics of 'Ray shooting and intersection searching amidst fat convex polyhedra in 3-space'. Together they form a unique fingerprint.

Cite this