Finite topology as applied to image analysis
Computer Vision, Graphics, and Image Processing
Digital Planar Segment Based Polyhedrization for Surface Area Estimation
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
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
Polyhedrization of the Boundary of a Voxel Object
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Strong thinning and polyhedric approximation of the surface of a voxel object
Discrete Applied Mathematics
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Fast, accurate and convergent tangent estimation on digital contours
Image and Vision Computing
Minimum decomposition of a digital surface into digital plane segments is NP-hard
Discrete Applied Mathematics
3D noisy discrete objects: Segmentation and application to smoothing
Pattern Recognition
Comparison and improvement of tangent estimators on digital curves
Pattern Recognition
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
Multi-scale Analysis of Discrete Contours for Unsupervised Noise Detection
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
An efficient and quasi linear worst-case time algorithm for digital plane recognition
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Multiscale Analysis from 1D Parametric Geometric Decomposition of Shapes
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
| Hi-index | 0.00 |
The sequence of maximal segments (i.e. the tangential cover) along a digital boundary is an essential tool for analyzing the geometry of two-dimensional digital shapes. The purpose of this paper is to define similar primitives for three-dimensional digital shapes, i.e. maximal planes defined over their boundary. We provide for them an unambiguous geometrical definition avoiding a simple greedy characterization as previous approaches. We further develop a multiscale theory of maximal planes. We show that these primitives are representative of the geometry of the digital object at different scales, even in the presence of noise.