A fast and elementary algorithm for digital plane recognition

Electronic Notes in Discrete Mathematics

Volumn 12, Issue , 2003, Pages 142-153

  Gerard Y ^a  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

chords set; digital naive plane; triangle

Indexed keywords

EID: 34247151605     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00481-0     Document Type: Article

References (10)

1. Buzer L. An Icremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem. Proceedings DGCI 2002, Lecture Notes in Computer Science 2301 (2002), Springer 372-381
2. th (1994), DGCI, Grenoble, France
3. Debled-Rennesson I., and Reveillés J.P. A linear algorithm for segmentation of digital curves. International Journal of Pattern Recognition and Artificial Intelligence 9 (1995) 635-662
4. J. Françon, J.M. Schramm & M. Tajine, Recognizing arithmetic straight lines and planes. 6th Conference on Discrete Geometry in Computer Imagery, Lyon, 1996.
5. Gerard Y. A Question of Digital Linear Algebra. Proceedings DGCI 2000, Lecture Notes in Computer Science 1953 (2000), Springer 126-136
6. Kim C.E. Three-Dimensional Digital Planes. IEEE, Transactions on Pattern Analysis and Machine Intelligence 6 (1948) 639-645
7. M. Mesmmoudi, A simplified recognition algorithm for digital planes pieces. Proceedings DGCI 2002, Lecture Notes in Computer Science 2301, Springer 2002.
8. Reveillés J.P. Combinatorial pieces in digital lines and planes. Vision Geometry IV, SPIE 2573 (1995)
9. Sarkar D., and Stojmenovic I. Parallel algorithms for separation of two sets of points and recognition of digital convex polygons. International Journal of Prallel Programming 21 2 (1992) 109-121
10. Vittone J., and Chassery J.M. Recognition of Digital Naive Planes and Polyhedrization. Proceedings DGCI 2000, Lecture Notes in Computer Science 1953 (2000), Springer 296-307