✦ LIBER ✦

Linear time distance transforms for quadtrees

✍ Scribed by Clifford A. Shaffer; Quentin F. Stout

Publisher: Elsevier Science
Year: 1991
Weight: 1021 KB
Volume: 54
Category: Article
ISSN: 1049-9660
DOI: 10.1016/1049-9660(91)90064-v

No coin nor oath required. For personal study only.

✦ Synopsis

Linear time algorithms are given for computing the chessboard distance transform for both pointer-based and linear quadtree representations. Comparisons between algorithmic styles for the two representations are made. Both versions of the algorithm consist of a pair of tree traversals. 0 I991 Academic PIW, IIIC.

📜 SIMILAR VOLUMES

Parallel distance transforms on a linear

Parallel distance transforms on a linear array architecture

✍ Tsorng-Lin Chia; Kuang-Bor Wang; Zen Chen; Der-Chyuan Lou 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Set operations for unaligned linear quad

Set operations for unaligned linear quadtrees

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

A New ASIC for Real-Time Linear Color Sp

A New ASIC for Real-Time Linear Color Space Transforms

✍ I. Andreadis; P. Iliades; Ph. Tsalides 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Linear quadtrees: A blocking technique f

Linear quadtrees: A blocking technique for contour filling

✍ I. Gargantini; H.H. Atkinson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 618 KB

An algorithm for transformations of pict

An algorithm for transformations of pictures represented by quadtrees

✍ Frans J. Peters 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 458 KB

A cost optimal parallel algorithm for we

A cost optimal parallel algorithm for weighted distance transforms

✍ Akihiro Fujiwara; Michiko Inoue; Toshimitsu Masuzawa; Hideo Fujiwara 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

The distance transform and the nearest feature transform are useful operations in image processing. These transforms are based on various kinds of distance functions because the distance functions have dierent eciency or usefulness. In this paper, we consider these transforms based on the weighted d