Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
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
Fast, accurate and convergent tangent estimation on digital contours
Image and Vision Computing
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Dynamic reconstruction of complex planar objects on irregular isothetic grids
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Revisiting digital straight segment recognition
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Computing the characteristics of a subsegment of a digital straight line in logarithmic time
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Dynamic minimum length polygon
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Walking in the farey fan to compute the characteristics of a discrete straight line subsegment
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Discrete Applied Mathematics
| Hi-index | 0.00 |
This paper presents a first step in analyzing how digital shapes behave with respect to multiresolution. We first present an analysis of the covering of a standard digital straight line by a multiresolution grid. We then study the multi-resolution of Digital Straight Segments (DSS): we provide a sublinear algorithm computing the exact characteristics of a DSS whenever it is a subset of a known standard line. We finally deduce an algorithm for computing a multiscale representation of a digital shape, based only on a DSS decomposition of its boundary.