Computational geometry: an introduction
Computational geometry: an introduction
On the recognition of digital planes in three-dimensional space
Pattern Recognition Letters
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Recognizing arithmetic straight lines and planes
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Discrete Applied Mathematics
A generalized preimage for the digital analytical hyperplane recognition
Discrete Applied Mathematics
Gift-wrapping based preimage computation algorithm
Pattern Recognition
| Hi-index | 0.00 |
In digital geometry, digital straightness is an important concept both for practical motivations and theoretical interests. Concerning the digital straightness in dimension 2, many digital straight line characterizations exist and the digital straight segment preimage is well known. In this article, we investigate the preimage associated to digital planes. More precisely, we present first structure theorems that describe the preimage of a digital plane. Furthermore, we present a bound on the number of preimage faces under some given hypotheses.