Quad-trees, oct-trees, and k-trees: a generalized approach to recursive decomposition of euclidean space
Related Experiment Video
Updated: May 29, 2026

Tree Core Analysis with X-ray Computed Tomography
Published on: September 22, 2023
11943 7th Avenue West, Seattle, WA 98119.
Abstract:
K-trees are developed as a K-dimensional analog of quad-trees and oct-trees. K-trees can be used for modeling K-dimensional data. A fast algorithm is given for finding the boundary size of a K-dimensional object represented by a K-tree. For K considered as con-stant; the algorithm provides a method for computing the perimeter of a quad-tree encoded image or the surface area of an oct-tree encoded object in worst case time proportional to the number of nodes in the tree. This improves upon the expected-case linear-time method of Samet [10] for the perimeter problem. Our method has been implemented in Pascal, and a computational example is given.
Related Concept Videos
Cartesian Vector Notation
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Quadratic Equations
Parallel-axis Theorem
Cartesian Form for Vector Formulation
Quadratic Models
