✦ LIBER ✦

Hypercube algorithms for operations on quadtrees

✍ Scribed by Ravi V. Shankar; Sanjay Ranka

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 493 KB
Volume: 25
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(92)90137-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quadtree Building Algorithms on an SIMD

Quadtree Building Algorithms on an SIMD Hypercube

✍ O.H. Ibarra; M.H. Kim 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 555 KB

We present \(O(\log n)\) time SIMD hypercube algorithms for transforming binary images to linear quadtrees and vice versa, where \(n\) is the size of the images as well as the number of hypercube nodes. Our quadtree building algorithm, which generates the locational codes in preorder, is an improvem

Set operations on linear quadtrees

✍ Michael A Bauer 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 133 KB

Set operations on linear quadtrees

✍ Michael A. Bauer 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 662 KB

Set operations for unaligned linear quad

Set operations for unaligned linear quadtrees

✍ Clifford A. Shaffer; Hanan Samet 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 74 KB

Algorithms for connected component label

Algorithms for connected component labeling based on quadtrees

✍ Kunio Aizawa; Shojiro Tanaka; Koyo Motomura; Ryosuke Kadowaki 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

## Abstract An algorithm of linear time complexity is presented to label connected components of a binary image by a quadtree. For a given node, the search for all adjacent nodes is carried out in __O__(1) (i.e., constant time complexity for the worst case) using our formerly presented algorithm in

Multicast Algorithms for Hypercube Multi

Multicast Algorithms for Hypercube Multiprocessors

✍ Shih-Hsien Sheu; Chang-Biau Yang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Depending on different switching technologies, the multicast communication problem has been formulated as three different graph theoretical problems: the Steiner tree problem, the multicast tree problem, and the multicast path problem. Our efforts in this paper are to reduce the communication traffi