A Reliable Extended Octree Representation of CSG Objects with an Adaptive Subdivision Depth

Octrees are among the most widely used representations in geometric modeling systems, apart from Constructive Solid Geometry and Boundary Representations. An octree model is based on recursive cell decompositions of the space and does not depend greatly on the nature of the object but much more on the chosen maximum subdivision level. Unfortunately, an octree may require a large amount of memory when it uses a set of very small cubic nodes to approximate an object. This paper is concerned with a novel generalization of the octree model that uses interval arithmetic and allows us to extend the tests for classifying points in space as inside, on or outside a CSG object to whole sections of the space at once. Tree nodes with additional information about relevant parts of the CSG object are introduced in order to reduce the depth of the required subdivision. The proposed extended octrees are compared with the common octree representation.

[1]  S. Petitjean,et al.  Towards the Robust Intersection of Implicit Quadrics , 2002 .

[2]  Ulrich W. Kulisch,et al.  C++ Toolbox for Verified Scientific Computing I: Basic Numerical Problems , 1997 .

[3]  G. Alefeld,et al.  Introduction to Interval Computation , 1983 .

[4]  Pere Brunet,et al.  Solid representation and operation using extended octrees , 1990, TOGS.

[5]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling: An Introduction , 1989 .

[6]  Ingrid Carlbom,et al.  A Hierarchical Data Structure for Representing the Spatial Decomposition of 3-D Objects , 1985, IEEE Computer Graphics and Applications.

[7]  Eva Dyllong,et al.  Verified Adaptive Octree Representations of Constructive Solid Geometry Objects , 2007, SimVis.

[8]  Jon G. Rokne,et al.  Geometric Computations with Interval and New Robust Methods: Applications in Computer Graphics, GIS and Computational Geometry , 2003 .

[9]  R. Hammer C++ Toolbox for Verified Scientific Computing - Theory, Algorithms and Programs: Basic Numerical Problems , 1995 .

[10]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling , 1989 .

[11]  K. Mehlhorn,et al.  Distance Computation for Extended Quadratic Complexes , 2005 .

[12]  Sylvain Lazard,et al.  Intersecting quadrics: an efficient and exact implementation , 2006, Comput. Geom..

[13]  Tom Duff,et al.  Interval arithmetic recursive subdivision for implicit functions and constructive solid geometry , 1992, SIGGRAPH.

[14]  Ulrich W. Kulisch,et al.  Numerical Toolbox for Verified Computing I , 1993 .

[15]  John M. Snyder,et al.  Generative Modeling for Computer Graphics and Cad: Symbolic Shape Design Using Interval Analysis , 1992 .

[16]  Joshua Z. Levin Mathematical models for determining the intersections of quadric surfaces , 1979 .

[17]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[18]  Christian Lennerz,et al.  Efficient distance computation for quadratic curves and surfaces , 2002, Geometric Modeling and Processing. Theory and Applications. GMP 2002. Proceedings.

[19]  James R. Miller,et al.  Geometric approaches to nonplanar quadric surface intersection curves , 1987, TOGS.

[20]  Tosiyasu L. Kunii,et al.  Space Division for Ray Tracing in CSG , 1986, IEEE Computer Graphics and Applications.