Computational geometry: an introduction
Computational geometry: an introduction
On-line construction of the convex hull of a simple polyline
Information Processing Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
A linear incremental algorithm for naive and standard digital lines and planes recognition
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Comparison of Discrete Curvature Estimators and Application to Corner Detection
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
Curvature estimation in noisy curves
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Robust estimation of curvature along digital contours with global optimization
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
A discrete geometry approach for dominant point detection
Pattern Recognition
Recognition of blurred pieces of discrete planes
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Fast polynomial segmentation of digitized curves
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Digital line recognition, convex hull, thickness, a unified and logarithmic technique
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
| Hi-index | 0.00 |
This paper is concerned with the naive and, more generally, α-thick digital line recognition problem. Previous incremental algorithms deal with the 8-connected case [DR95] or with sophisticated machinery coming from Linear Programming [Buz03]. We present the first elementary method [Buz02] that works with any set of points (not necessarily 8-connected) and we propose a linear time algorithm under some restrictions (which were implicitly assumed in [DR95]). This paper deals with implementation details giving pseudo-code of our method. We insist on linking the recognition problem to the intrinsic properties of convex hulls.