Apercu sur les quadarbres et les structures de donnees hierarchiques. Elles sont basees sur le principe de decomposition recursive. L'accentuation est mise sur la representation de donnees dans les applications de traitement d'images, d'infographie, les systemes d'informations geographiques et la robotique. On examine en detail un certain nombre d'operations dans lesquelles de telles structures de donnees trouvent leur utilisation

/pdf/the-quadtree-and-related-hierarchical-data-structures-38sprs9bn9.pdf

The Quadtree and Related Hierarchical Data Structures

An octree-based fully automatic three-dimensional mesh generator is presented. The mesh generator is capable of meshing non-manifold models of arbitrary geometric complexity through the explicit tracking and enforcement of geometric compatibility and geometric similarity at each step of the meshing process. The resulting procedure demonstrates a linear growth rate with respect to the number of elements and can be easily integrated with any geometric modeller through a set of geometric operators.

Automatic three‐dimensional mesh generation by the finite octree technique

The large size of many volume data sets often prevents visualization algorithms from providing interactive rendering. The use of hierarchical data structures can ameliorate this problem by storing summary information to prevent useless exploration of regions of little or no current interest within the volume. This paper discusses research into the use of the octree hierarchical data structure when the regions of current interest can vary during the application, and are not known a priori. Octrees are well suited to the six-sided cell structure of many volumes.A new space-efficient design is introduced for octree representations of volumes whose resolutions are not conveniently a power of two; octrees following this design are called branch-on-need octrees (BONOs). Also, a caching method is described that essentially passes information between octree neighbors whose visitation times may be quite different, then discards it when its useful life is over.Using the application of octrees to isosurface generation as a focus, space and time comparisons for octree-based versus more traditional “marching” methods are presented.

Octrees for faster isosurface generation

A new generation of industrial geometry systems is emerging based on the technology of the 1970's. The generations of the eighties and nineties will require more research.

Solid Modeling: A Historical Summary and Contemporary Assessment

In this article we propose algorithms that address the two basic problems encountered in generating continuous-tone images by ray tracing: speed and aliasing. We examine previous approaches to the problem and then propose a scheme based on the coherency of an auxiliary data structure imposed on the original object domain. After investigating both simple spatial enumeration and a hybrid octree approach, we developed 3DDDA, a 3D line generator for efficient traversing of both structures. 3DDDA provides an order of magnitude improvement in processing speed compared to other known ray-tracing methods. Processing time is found to be virtually independent of the number of objects involved in the scene. For large numbers of objects, this method actully becomes faster than scan-line methods. To remove jags from edges, a scheme for identifying edge orientation and distance from pixel center to true edge has been implemented. The time required for antialiasing depends on the total length of the edges encountered, but it is normally only a fractional addition to the time needed to produce the scene without antialiasing.

ARTS: accelerated ray-tracing system

A family of algorithms and extensions provides a computationally efficient means of displaying shaded, semitransparent 3-D objects.

Torborg

Papers

Display Techniques for Octree-Encoded Objects