✦ LIBER ✦

An optimal algorithm for decomposing a window into maximal quadtree blocks

✍ Scribed by Guido Proietti

Book ID: 105931092
Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 83 KB
Volume: 36
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s002360050160

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposing a window into maximal quadtr

Decomposing a window into maximal quadtree blocks

✍ Walid G. Aref; Hanan Samet 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 801 KB

An algorithm for decomposing a polynomia

An algorithm for decomposing a polynomial system into normal ascending sets

✍ Ding-kang Wang; Yan Zhang 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 201 KB

An efficient algorithm for decomposing a

An efficient algorithm for decomposing a polygon into star-shaped polygons

✍ D. Avis; G.T. Toussaint 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 291 KB

An algorithm for decomposing a class of

An algorithm for decomposing a class of matrices into lower and upper triangular matrices

✍ Reza R. Adhami; David J. Lanteigne; Don A. Gregory 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 234 KB

An O(kN.log N) algorithm for decomposing

An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components

✍ Sukhamay Kundu; Radhakrishnan Sridhar 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 630 KB

A New Efficient Algorithm for Embedding

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar