Discrete Applied Mathematics
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
Image and Vision Computing
Continuous digitization in Khalimsky spaces
Journal of Approximation Theory
The supercover of an m-flat is a discrete analytical object
Theoretical Computer Science
On digital plane preimage structure
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
An elementary digital plane recognition algorithm
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Theoretical Computer Science
How to find a khalimsky-continuous approximation of a real-valued function
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Computational aspects of digital plane and hyperplane recognition
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
A plate-based definition of discrete surfaces
Pattern Recognition Letters
A simple proof of Rosenfeld's characterization of digital straight line segments
Pattern Recognition Letters
Concurrency relations between digital planes
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.15 |
Definitions of 3-D digital surface and plane are introduced. Many geometric properties of these objects are examined. In particular, it is shown that digital convexity is neither a necessary nor a sufficient condition for a digital surface element to be a convex digital plane element, but it is both necessary and sufficient for a digital surface to be a digital plane. Also algorithms are presented to determine whether or not a finite set of digital points is a (convex) digital plane element.