Contour polygonal approximation using shortest path in networks
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 we model a regular network. Then we transform this network into a Small-World Complex Network by applying some transformations over its edges. By analyzing of network properties, especially the geodesic path, we compute the polygonal approximation. 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.
Cite
@article{arxiv.1311.4252,
title = {Contour polygonal approximation using shortest path in networks},
author = {André Ricardo Backes and Dalcimar Casanova and Odemir Martinez Bruno},
journal= {arXiv preprint arXiv:1311.4252},
year = {2013}
}
Comments
12 pages, 12 figures