Article thumbnail
Location of Repository

Rectilinear BSP Trees for Preferred Ray Sets

By Vlastimil Havran and Jiri Bittner

Abstract

Rectilinear Binary Space Partitioning (BSP) trees are often used for solving various types of range searching problems including ray shooting. We propose a novel method for construction of rectilinear BSP trees for a preferred set of ray shooting queries. Particularly, we study ray sets formed by fixing either the direction or the origin of rays. We analyse and discuss the properties of constructed trees. Theoretical considerations are followed by results obtained from the practical implementation. Keywords: ray shooting, ray casting, spatial data structures, BSP tree, clipping.

Topics: ray shooting, ray casting, spatial data structures
Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.21.3952
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mpi-sb.mpg.de/~havr... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.