✦ LIBER ✦

Matching of 3D polygonal arcs

✍ Scribed by Heisterkamp, D.R.; Bhatacharya, P.

Book ID: 117873304
Publisher: IEEE
Year: 1997
Tongue: English
Weight: 672 KB
Volume: 19
Category: Article
ISSN: 0162-8828
DOI: 10.1109/34.566813

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching sets of 3D line segments with a

Matching sets of 3D line segments with application to polygonal arc matching

✍ Kamgar-Parsi, B. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 280 KB

Matching general polygonal arcs

✍ Behzad Kamgar-Parsi; Avraham Margalit; Azriel Rosenfeld 📂 Article 📅 1991 🏛 Elsevier Science ⚖ 828 KB

In this paper we present an algorithm for matching two polygonal arcs. We first show how to match two arcs of the same length by decomposition into pairs of equal length line segments. The distance measure used is the sum of the squared distances between corresponding points on the two arcs. We find

Matching 2D Polygonal Arcs by Using a Su

Matching 2D Polygonal Arcs by Using a Subgroup of the Unit Quaternions

✍ Douglas R. Heisterkamp; Prabir Bhattacharya 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Approximate matching of polygonal shapes

✍ Helmut Alt; Bernd Behrends; Johannes Blömer 📂 Article 📅 1995 🏛 Springer Netherlands 🌐 English ⚖ 861 KB

Optimal matching of convex polygons

✍ Pedro Cox; Henri Maitre; Michel Minoux; Celso Ribeiro 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Optimal matching of nonconvex polygons

✍ Jose A. Ventura; Jen-Ming Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 438 KB