Efficient Dominant Point Detection Based on Discrete Curve Structure
In this paper, we investigate the problem of dominant point detection on digital curves which consists in finding points with local maximum curvature. Thanks to previous studies of the decomposition of curves into sequence of discrete structures [5, 6, 7], namely maximal blurred segments of width \(\nu \) , an initial algorithm has been proposed in  to detect dominant points. However, an heuristic strategy is used to identify the dominant points. We now propose a modified algorithm without heuristics but a simple measure of angle. In addition, an application of polygonal simplification is as well proposed to reduce the number of detected dominant points by associating a weight to each of them. The experimental results demonstrate the efficiency and robustness of the proposed method.
KeywordsDominant point Polygonal simplification Discrete structure
- 15.Reveillès, J.P.: Géométrie discrète, calculs en nombre entiersgorithmique, thèse d’état. Université Louis Pasteur, Strasbourg (1991)Google Scholar