Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Recognizing Sharp Features of 2-D Shapes

Recognizing Sharp Features of 2-D Shapes Recognizing Sharp Features of 2-D Shapes We present an efficient algorithm for recognizing and extracting sharp-features from complex polygonal shapes. The algorithm executes in O(n 2 ) time, where n is the number of vertices in the polygon. Sharp-feature extraction algorithms can be useful as a pre-processing step for measuring shape-similarity between polygonal shapes. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Electronics and Telecommunications de Gruyter

Recognizing Sharp Features of 2-D Shapes

Download PDF
4 pages

Loading next page...
 
/lp/de-gruyter/recognizing-sharp-features-of-2-d-shapes-YA1xVT2xfU

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
Copyright © 2010 by the
ISSN
0867-6747
DOI
10.2478/v10177-010-0020-5
Publisher site
See Article on Publisher Site

Abstract

Recognizing Sharp Features of 2-D Shapes We present an efficient algorithm for recognizing and extracting sharp-features from complex polygonal shapes. The algorithm executes in O(n 2 ) time, where n is the number of vertices in the polygon. Sharp-feature extraction algorithms can be useful as a pre-processing step for measuring shape-similarity between polygonal shapes.

Journal

International Journal of Electronics and Telecommunications – de Gruyter

Published: Jun 1, 2010

References

  • An efficiently computable metric for comparing polygonal shapes
    E. Arkin
  • Polygonal chain approximation: a query based approach
    O. Daescu
  • B-spline curve smoothing under position constraints for line generalisation
    E. Gulbert
  • Biarc approximations of polygons within asymmetric tolerance bands
    M. Held