Matching of 3-D curves

Douglas R. Heisterkamp; Pritam Bhattacharya

doi:10.1109/robot.1996.509244

ScienceGate Book Chapters

JOURNAL ARTICLE

Matching of 3-D curves

Douglas R. Heisterkamp Pritam Bhattacharya

Year: 2002 Vol: 4 Pages: 3490-3495

DOI: 10.1109/robot.1996.509244

Get Full-Text PDF Get Analytical Report

Abstract

We show that the minimum value of a distance measure between 3-D polygonal arcs of equal length is the smallest eigenvalue of a certain matrix. Using this we develop a mismatch measure and a matching algorithm for 3-D polygonal arcs of unequal lengths.

Keywords:

Measure (data warehouse) Matching (statistics) Eigenvalues and eigenvectors Mathematics Matrix (chemical analysis) Length measurement Value (mathematics) Algorithm Arc length Polygonal chain Combinatorics Computer science Geometry Statistics Arc (geometry) Physics Optics Data mining

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.18

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

3D Shape Modeling and Analysis

Physical Sciences → Engineering → Computational Mechanics

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Image Processing and 3D Reconstruction

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Matching of 3-D curves

Abstract

Metrics

Topics

Related Documents

Smoothing and matching of 3-D space curves

Smoothing and matching of 3-d space curves

Matching of 3-D curves using semi-differential invariants

A new genetic-based technique for matching 3-D curves and surfaces

Matching 3-D arcs