BOXTREE: A Hierarchical Representation for Surfaces in 3D

We introduce the boxtree, a versatile data structure for representing triangulated or meshed surfaces in 3D. A boxtree is a hierarchical structure of nested boxes that supports efficient ray tracing and collision detection. It is simple and robust, and requires minimal space. In situations where storage is at a premium, boxtrees are effective alternatives to octrees and BSP trees. They are also more flexible and efficient than R‐trees, and nearly as simple to implement.

[1]  M. Hartmann,et al.  Light scattering by small particles. Von H. C. VANDE HULST. New York: Dover Publications, Inc. 1981. Paperback, 470 S., 103 Abb. und 46 Tab., US $ 7.50 , 1984 .

[2]  Olivier D. Faugeras,et al.  An object centered hierarchical representation for 3D objects: The prism tree , 1987, Comput. Vis. Graph. Image Process..

[3]  A. Guttman,et al.  A Dynamic Index Structure for Spatial Searching , 1984, SIGMOD 1984.

[4]  Christos Faloutsos,et al.  The A dynamic index for multidimensional ob-jects , 1987, Very Large Data Bases Conference.

[5]  Mark de Berg,et al.  Efficient ray shooting and hidden surface removal , 1991, SCG '91.

[6]  James T. Kajiya,et al.  Ray tracing complex scenes , 1986, SIGGRAPH.

[7]  Mark de Berg,et al.  Efficient algorithms for ray shooting and hidden surface removal , 1992 .

[8]  H. V. Hulst.  Light Scattering by Small Particles , 1957 .

[9]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[10]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

[11]  Subhash Suri,et al.  Stabbing triangulations by lines in 3D , 1995, SCG '95.

[12]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[13]  Ming C. Lin,et al.  Efficient collision detection for animation and robotics , 1993 .

[14]  Philip M. Hubbard,et al.  Collision Detection for Interactive Graphics Applications , 1995, IEEE Trans. Vis. Comput. Graph..

[15]  Marco Pellegrini,et al.  Stabbing and ray shooting in 3 dimensional space , 1990, SCG '90.

[16]  Nick Roussopoulos,et al.  Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.

[17]  Dana H. Ballard,et al.  Strip trees: a hierarchical representation for curves , 1981, CACM.

[18]  John Salmon,et al.  Automatic Creation of Object Hierarchies for Ray Tracing , 1987, IEEE Computer Graphics and Applications.

[19]  Roman Kuchkuda,et al.  An introduction to ray tracing , 1993, Comput. Graph..

[20]  Timos K. Sellis,et al.  Optimization Issues in R-tree Construction (Extended Abstract) , 1994, IGIS.

[21]  Nick Roussopoulos,et al.  Faloutsos: "the r+- tree: a dynamic index for multidimensional objects , 1987 .

[22]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[23]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[24]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[25]  Hanan Samet,et al.  Spatial Data Structures , 1995, Modern Database Systems.

[26]  Martin Held,et al.  Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs , 1995 .