Browsing by Subject "Hierarchical data structures"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Ray representation for k-trees
    (Elsevier, 1989) Akman, V.; Franklin, Wm. R.
    k-trees have established themselves as useful data structures in pattern recognition. A fundamental operation regarding k-trees is the construction of a k-tree. We present a method to store an object as a set of rays and an algorithm to convert such a set into a k-tree. The algorithm is conceptually simple, works for any k, and builds a k-tree from the rays very fast. It produces a minimal k-tree and does not lead to intermediate storage swell. © 1989.
  • Thumbnail Image
    ItemOpen Access
    Representing objects as rays, or how to pile up an octree?
    (Elsevier, 1989) Akman, V.; Franklin, Wm. R.
    Quadtrees, octrees, and in general k-trees have established themselves as useful hierarchical data structures in computer graphics, image processing, and solid modeling. A fundamental operation in a system based on k-trees is the construction of a k-tree. Here, we review a new way of doing this operation. Basically, we have invented a method to store an object as a set of rays and an algorithm for converting such a set into a k-tree. (For example, in 3D a ray is a thin parallelepiped.) The algorithm is conceptually simple, works for any k, and piles up, using an approach we call stacking, a k-tree from the rays very fast. It produces a minimal k-tree and does not lead to intermediate storage swell. For large-scale realistic objects, which consist of many thousands of rays, the algorithm debunks the "expensive octree creation" myth. © 1989.