ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Pattern Recognition
Volume 26, Issue 4, April 1993, Pages 505-509
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (316 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0031-3203(93)90106-7    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1993 Published by Elsevier Science B.V.

Determination of optimal polygon from digital curve using L1 norm

Bimal Kumar Ray and Kumar S. RayCorresponding Author Contact Information

Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B. T. Road, Calcutta 700035, India

Received 22 January 1992; 
revised 19 June 1992; 
accepted 18 August 1992. ;
Available online 19 May 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

A technique to determine optimal polygons of digital curves is proposed. It determines the longest possible line segments with the minimum possible error. The L1 norm is used to measure the closeness of a polygon to a digital curve. The algorithm runs in linear time. The procedure is applied to several digital curves and promising results are obtained.

Author Keywords: Polygonal approximation

Article Outline

• References

Pattern Recognition
Volume 26, Issue 4, April 1993, Pages 505-509
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.