Display Techniques for Octree-Encoded Objects

TL;DR: An octree-based fully automatic three-dimensional mesh generator is presented, 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.

TL;DR: 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).

TL;DR: After investigating both simple spatial enumeration and a hybrid octree approach, 3DDDA is developed, a 3D line generator for efficient traversing of both structures and provides an order of magnitude improvement in processing speed compared to other known ray-tracing methods.

TL;DR: In this article, a branch-on-need octree (BONO) data structure is proposed to store summary information to prevent useless exploration of regions of little or no current interest within the volume.

TL;DR: A regular decomposition of picture area into successively smaller quadrants is defined, which involves logarithmic search, and the resulting picture representation is shown to enable rapid access of image data without regard to position, efficient storage, and approximate structural descriptions of constituent patterns.

TL;DR: An algorithm is presented for constructing a quadtree for a binary image given its row-by-row description and its execution time is proportonal to the number of pixels comprising the image.

TL;DR: An algorithm is presented for obtaining a raster representation for an image given its quadtree and its execution time is proportional to the sum of the heights of the blocks comprising the image.