Dual bounds and exact algorithms for minimum dilation problems in geometric graphs
Robust Polygonal Approximation of Implicit Curves and Surfaces
| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Fed Uberlandia, Fac Comp Facom, BR-38408100 Uberlandia, MG - Brazil
[2] Univ Sao Paulo, Sao Carlos Inst Phys IFSC, Sci Comp Grp, BR-13566590 Sao Carlos, SP - Brazil
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | INTERNATIONAL JOURNAL OF MODERN PHYSICS C; v. 25, n. 2 FEB 2014. |
| Web of Science Citations: | 1 |
| 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. (AU) | |
| FAPESP's process: | 11/01523-1 - Computer vision methods applied to the identification and analysis of plants |
| Grantee: | Odemir Martinez Bruno |
| Support Opportunities: | Regular Research Grants |