An elementary digital plane recognition algorithm

A naive digital plane is a subset of points (x, y, z) ∈ Z3 verifying h ≤ ax + by + cz < h + max{|a|, |b|, |c|}, where (a, b, c, h) ∈ Z4. Given a finite unstructured subset of Z3, the problem of the digital plane recognition is to determine whether there exists a naive digital plane containing it. This question is rather classical in the field of digital geometry (also called discrete geometry). We suggest in this paper a new algorithm to solve it. Its asymptotic complexity is bounded by O(n7) but its behavior seems to be linear in practice. It uses an original strategy of optimization in a set of triangular facets (triangles). The code is short and elementary (less than 300 lines) and available on http://www.loria.fr/~debled/plane.

[1]  Dilip Sarkar,et al.  Parallel algorithms for separation of two sets of points and recognition of digital convex polygons , 1992, International Journal of Parallel Programming.

[2]  Peter Veelaert.  Digital Planarity of Rectangular Surface Segments , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Mohammed Mostefa Mesmoudi.  A Simplified Recognition Algorithm of Digital Planes Pieces , 2002, DGCI.

[4]  Mohamed Tajine,et al.  Recognizing arithmetic straight lines and planes , 1996, DGCI.

[5]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[6]  Chul E. Kim.  Three-Dimensional Digital Planes , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Jean-Pierre Reveillès,et al.  Géométrie discrète, calcul en nombres entiers et algorithmique , 1991 .

[8]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[9]  V. Kovalevsky,et al.  New definition and fast recognition of digital straight segments and arcs , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[10]  Isabelle Debled-Rennesson,et al.  A Linear Algorithm for Segmentation of Digital Curves , 1995, Int. J. Pattern Recognit. Artif. Intell..

[11]  Lilian Buzer.  An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem , 2002, DGCI.

[12]  Peter Veelaert,et al.  On the flatness of digital hyperplanes , 1993, Journal of Mathematical Imaging and Vision.

[13]  Ivan Stojmenovic,et al.  On the recognition of digital planes in three-dimensional space , 1991, Pattern Recognit. Lett..

[14]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[15]  Jean-Pierre Reveilles,et al.  Combinatorial pieces in digital lines and planes , 1995, Optics & Photonics.

[16]  Isabelle Debled-Rennesson,et al.  Incremental algorithm for recognizing pieces of digital planes , 1996, Optics & Photonics.

[17]  Jean-Marc Chassery,et al.  Recognition of Digital Naive Planes and Polyhedrization , 2000, DGCI.

[18]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[19]  Reinhard Klette,et al.  Digital Planar Segment Based Polyhedrization for Surface Area Estimation , 2001, IWVF.

[20]  G. Ziegler.  Lectures on Polytopes , 1994 .