✦ LIBER ✦

On fast computation of distance between line segments

✍ Scribed by Vladimir J. Lumelsky

Book ID: 113162760
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 541 KB
Volume: 21
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(85)90032-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast computation of distance estimators

✍ Isaac Elias; Jens Lagergren 📂 Article 📅 2007 🏛 BioMed Central 🌐 English ⚖ 710 KB

Fast computation of the ambiguity functi

Fast computation of the ambiguity function and the Wigner distribution on arbitrary line segments

✍ Ozdemir, A.K.; Arikan, O. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 625 KB

Line segment Hausdorff distance on face

Line segment Hausdorff distance on face matching

✍ Yongsheng Gao; Maylor K.H. Leung 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 531 KB

A novel concept of line segment Hausdor! distance is proposed in this paper. Researchers apply Hausdor! distance to measure the similarity of two point sets. It is extended here to match two sets of line segments. The new approach has the advantage to incorporate structural and spatial information t

On a relation between four line-segments

✍ O. Bottema 📂 Article 📅 1965 🏛 Springer 🌐 English ⚖ 577 KB

On computing connected components of lin

On computing connected components of line segments

✍ Lopez, M.A.; Thurimella, R. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 577 KB

Fast computation of normalized edit dist

Fast computation of normalized edit distances

✍ Vidal, E.; Marzal, A.; Aibar, P. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 452 KB