On the recognition of digital planes in three-dimensional space
Pattern Recognition Letters
Digital Planarity of Rectangular Surface Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
An elementary digital plane recognition algorithm
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
Computational aspects of digital plane and hyperplane recognition
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
| Hi-index | 0.00 |
Debled proposed an efficient algorithm for the recognition of rectangular digital planes pieces. However, uses, in some cases called strongly exterior cases, some validity criteria which are only sufficient but not necessary. In this paper we give necessary and sufficient conditions (including strongly exterior cases) to recognize pieces of digital planes. We build up a simplified form of Debled's algorithm. Furthermore, our approach is independent from the rectangular form of pieces considered by Debled.