.png){kind=icon}
.png){kind=icon}
Return
Geometric algorithm for dominant point extraction from shape contour
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-012-0311-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we propose a new algorithm for extracting dominant points from the real contour of a digital shape. A polygonal approximation of the shape can be obtained by the set of dominant points. In the proposed algorithm, in the first step before searching for dominant points, the real contour is made sparse using a geometric concept, named convex deficiency tree. This helps to select a set of candidate points from real contour. In comparison with break points (which are initial points in many algorithms), the set of candidate points is more heuristic and the ratio of them to the all points of the contour is lower. In the second step of the proposed algorithm, the less informative candidate points are removed in an iterative manner. After removing one candidate point, its adjacent positions are searched to find more stable position for its neighbors. The comparative result of the proposed algorithm with others shows its efficiency. The algorithm finds an effective polygonal approximation for digital shapes especially for the real contours, which makes the method more practical.
Keywords:
Dominant point
Polygonal approximation
Digital planner curve
Shape representation
Convex deficiency tree
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2
Papers:
1.9K
Citations:
1.9K