Published in

World Scientific Publishing, International Journal of Modern Physics C, 02(25), p. 1350090

DOI: 10.1142/s0129183113500903

Links

Tools

Export citation

Search in Google Scholar

Contour Polygonal Approximation Using the Shortest Path in Networks

Journal article published in 2014 by André Ricardo Backes ORCID, Dalcimar Casanova, Odemir Martinez Bruno ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Contour polygonal approximation is a simplified representation of a contour by line segments so that the main characteristics of the contour remain in a small number of line segments. This paper presents a novel method for polygonal approximation based on the Complex Networks theory. We convert each point of the contour into a vertex so that a regular network can be modeled. Then we transform this network into a Small-World Complex Network by applying some transformations over its edges. We compute the polygonal approximation analyzing the network properties, especially the geodesic path. The paper presents the main characteristics of the method, as well as its functionality. We evaluate the proposed method using benchmark contours and compare its results with other polygonal approximation methods.