Efficient octree conversion by connectivity labeling

TL;DR: An overview of hierarchical data structures for representing images, such as the quadtree and octree, is presented, based on the principle of recursive decomposition, with a greater emphasis on region data and to a lesser extent on point, line, and 3-dimensional data.

TL;DR: The paper contains a synopsis of the architectures and algorithms used in eight machines to render three-dimensional medical images, with particular emphasis paid to their distinctive contributions.

TL;DR: This paper divides these algorithms related to octrees into two categories, construction and manipulation of octrees, and gives a detailed survey of them.

TL;DR: A multiresolution approach for a large class of hierarchical and nested grids is presented, based on a hierarchical traversal of mesh elements combined with an adaptive selection of the hierarchical depth.

TL;DR: L'accentuation est mise sur la representation de donnees dans les applications de traitement d'images, d'infographie, les systemes d'informations geographiques and the robotique.

TL;DR: It is shown that, if t(m, n) is seen as the maximum time reqmred by a sequence of m > n FINDs and n -- 1 intermixed UNIONs, then kima(m), n is shown to be related to a functional inverse of Ackermann's functmn and as very slow-growing.

TL;DR: A coherent view, based on sound theoretical principles, of what is presently known about the representation of solids is provided by providing a simple mathematical framework for characterizing certain important aspects of representations, for example, their semantic (geometric) integrity.

TL;DR: Oct-Trees are developed as a three-dimensional analog of quad-trees to be used in geometric modeling and space planning and a fast algorithm is given for 90° rotation of oct-tree representations of objects.