Name
Abstract | ||
|---|---|---|
A linear-time algorithm is proposed for polygonal approximation of digital curves. The direction changes of the x- and y-coordinates are traced to generate a new, compact representation of curves. The algorithm, Direction Change-based Polygonal Approximation (DCPA), has two advantages: linear time complexity and insensitivity to parameter setting. Benchmark results demonstrate the competitive performance of DCPA using standard assessment techniques. |
Year | Venue | Keywords |
|---|---|---|
2012 | ICPR | insensitivity,image representation,y-coordinates,linear-time algorithm,x-coordinates,polynomial approximation,digital curves,parameter setting,computational complexity,direction change-based polygonal approximation,linear time complexity,dcpa,geometry,direction change-based algorithm |
Field | DocType | ISSN |
Polygon,Computer science,Minimax approximation algorithm,Image representation,Algorithm,Time complexity,Computational complexity theory | Conference | 1051-4651 |
ISBN | Citations | PageRank |
978-1-4673-2216-4 | 0 | 0.34 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Han Liu | 1 | 55 | 3.31 |
| Xiangliang Zhang | 2 | 728 | 87.74 |
| Alyn Rockwood | 3 | 950 | 179.19 |