Discrete Curvature Based on Osculating Circle Estimation
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Digital Lines and Digital Convexity
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Detection of the discrete convexity of polyominoes
Discrete Applied Mathematics
A Comparative Evaluation of Length Estimators of Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Polygonal Representations of Digital Sets
Algorithmica
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Canonical representations of discrete curves
Pattern Analysis & Applications
Journal of Mathematical Imaging and Vision
Fast, accurate and convergent tangent estimation on digital contours
Image and Vision Computing
Minimum-Perimeter Polygons of Digitized Silhouettes
IEEE Transactions on Computers
On the min DSS problem of closed discrete curves
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A linear algorithm for polygonal representations of digital sets
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Dynamic minimum length polygon
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A linear time and space algorithm for detecting path intersection in Zd
Theoretical Computer Science
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Discrete Applied Mathematics
| Hi-index | 0.00 |
The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary into convex and concave parts. In addition, other data are computed at the same time without any extra cost: the hull of each convex or concave part as well as the Bezout points of each edge of those hulls. The proposed algorithm involves well-understood algorithms: adding a point to the front or removing a point from the back of a digital straight segment and computing the set of maximal segments. The output of the algorithm is useful either for a polygonal representation of digital boundaries or for a segmentation into circular arcs.