✦ LIBER ✦

The Euclidean distance construction of order homomorphisms

✍ Scribed by Douglas S. Bridges

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 586 KB
Volume: 15
Category: Article
ISSN: 0165-4896
DOI: 10.1016/0165-4896(88)90021-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Computation of the Euclidean D

Efficient Computation of the Euclidean Distance Transform

✍ Laurence Boxer; Russ Miller 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 31 KB

On the uniqueness of Euclidean distance

On the uniqueness of Euclidean distance matrix completions

✍ Abdo Y. Alfakih 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 138 KB

On the nonnegative rank of Euclidean dis

On the nonnegative rank of Euclidean distance matrices

✍ Matthew M. Lin; Moody T. Chu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 167 KB

The Euclidean distance matrix for distinct points in ℝ is generically of rank + 2. It is shown in this paper via a geometric argument that its nonnegative rank for the case = 1 is generically .

The partially ordered family of CM-homom

The partially ordered family of CM-homomorphisms

✍ David I. Adu 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 833 KB

On the Homomorphism Order of Labeled Pos

On the Homomorphism Order of Labeled Posets

✍ Léonard Kwuida; Erkko Lehtonen 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 383 KB

Corrigendum to “Efficient Computation of

Corrigendum to “Efficient Computation of the Euclidean Distance Transform”

✍ Laurence Boxer; Russ Miller 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 52 KB

An algorithm for the distance transform of a binary image was presented in L. Boxer and R. Miller (Comput. Vision Image Understand. 80, 2000, 379-383). The algorithm was stated for the Euclidean metric. In this Corrigendum, we show that the algorithm of Boxer and Miller (2000) is correct for the L 1