Skip to main content
Springer Nature Link
Log in

Computational Aspects of Digital Plane and Hyperplane Recognition

  • Conference paper
Combinatorial Image Analysis (IWCIA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4040))

Included in the following conference series:

Abstract

In these note we review some basic approaches and algorithms for discrete plane/hyperplane recognition. We present, analyze, and compare related theoretical and experimental results and discuss on the possibilities for creating algorithms with higher efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Qhull, http://www.qhull.org/

  2. Acketa, D.M., Žunić, J.D.: On the maximal number of edges of convex digital polygons included into a m×m-grid. Journal of Combinatorial Theory Serie A(69), 358–368 (1995)

    Google Scholar 

  3. Andres, E., Acharya, R., Sibata, C.: Discrete analytical hyperplanes. Graphical Models and Image Processing 59(5), 302–309 (1997)

    Article  Google Scholar 

  4. Avis, D.: lrs: implementation as a callable library of the reverse search algorithm for vertex enumeration/convex hull problems, http://cgm.cs.mcgill.ca/~avis/C/lrs.html

  5. Balog, A., Bárány, I.: On the convex hull of the integer points in a disc. In: ACM -SIGACT ACM-SIGGRAPH (ed.) Proceedings of the 7th Annual Symposium on Computational Geometry (SCG 1991), North Conway, NH, USA, June 1991, pp. 162–165. ACM Press, New York (1991)

    Chapter  Google Scholar 

  6. Barany, I.: Random points, convex bodies, lattices. In: ICM: Proceedings of the International Congress of Mathematicians (2002)

    Google Scholar 

  7. Barany, I., Howe, Lovasz: On integer points in polyhedra: A lower bound. Combinatorica 12 (1992)

    Google Scholar 

  8. Bárány, I., Larman, D.G.: The convex hull of the integer points in a large ball. Math. Annalen 312, 167–181 (1998)

    Article  MATH  Google Scholar 

  9. Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software 22(4), 469–483 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Barneva, R.P., Brimkov, V.E., Nehlig, P.: Thin discrete triangular meshes. Theoretical Computer Science 246(1-2), 73–105 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bremner, D.: Incremental convex hull algorithms are not output sensitive. Discrete & Computational Geometry 21(1), 57–68 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Brimkov, V., Coeurjolly, D., Klette, R.: Digital planarity - a review. Technical report, Laboratoire LIRIS, Université Claude Bernard Lyon 1 (2004), http://liris.cnrs.fr/publis/?id=1933

  13. Brimkov, V.E., Dantchev, S.S.: Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension. In: Andrès, É., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol. 3429, pp. 287–298. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Buzer, L.: A linear incremental algorithm for naive and standard digital lines and planes recognition. Graphical Models 65(1-3), 61–76 (2003)

    Article  MATH  Google Scholar 

  15. Coeurjolly, D.: Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces. PhD thesis, Université Lumière Lyon 2, Bron, Laboratoire ERIC (December 2002)

    Google Scholar 

  16. Coeurjolly, D., Guillaume, A., Sivignon, I.: Reversible discrete volume polyhedrization using marching cubes simplification. In: SPIE Vision Geometry XII, San Jose, USA, vol. 5300, pp. 1–11 (2004)

    Google Scholar 

  17. Coeurjolly, D., Sivignon, I., Dupont, F., Feschet, F., Chassery, J.-M.: On digital plane preimage structure. Discrete Applied Mathematics 151(1–3), 78–92 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Debled-Rennesson, I.: Etude et reconnaissance des droites et plans discrets. PhD thesis, Université Louis Pasteur (1995)

    Google Scholar 

  19. Françon, J., Schramm, J.M., Tajine, M.: Recognizing arithmetic straight lines and planes. In: Miguet, S., Ubéda, S., Montanvert, A. (eds.) DGCI 1996. LNCS, vol. 1176, pp. 141–150. Springer, Heidelberg (1996)

    Google Scholar 

  20. Françon, J., Papier, L.: Polyhedrization of the boundary of a voxel object. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 425–434. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  21. Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  22. Gerard, Y., Debled-Rennesson, I., Zimmermann, P.: An elementary digital plane recognition algorithm. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 151 (2005)

    Google Scholar 

  23. Kim, C.E.: Three-dimensional digital planes. IEEE Trans. on Pattern Analysis and Machine Intelligence 6, 639–645 (1984)

    Article  MATH  Google Scholar 

  24. Kim, C.E., Stojmenovic, I.: On the recognition of digital planes in three-dimensional space. Pattern Recognition Letters 12(11), 665–669 (1991)

    Article  Google Scholar 

  25. Klette, R., Stojmenovic, I., Zunic, J.D.: A parametrization of digital planes by least-squares fits and generalizations. CVGIP: Graphical Model and Image Processing 58(3), 295–300 (1996)

    Article  Google Scholar 

  26. Klette, R., Sun, H.J.: Digital planar segment based polyhedrization for surface area estimation. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol. 2059, pp. 356–366. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Megiddo, N.: Linear programming in linear time when the dimension is fixed. JACM: Journal of the ACM 31 (1984)

    Google Scholar 

  28. Mesmoudi, M.M.: A simplified recognition algorithm of digital planes pieces. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol. 2301, pp. 404–416. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  29. Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)

    Google Scholar 

  30. Rosenfeld, A.: Digital straight lines segments. IEEE Transactions on Computers, 1264–1369 (1974)

    Google Scholar 

  31. Rosenfeld, A., Klette, R.: Digital straightness. In: Int. Workshop on Combinatorial Image Analysis. Electronic Notes in Theoretical Computer Science, vol. 46. Elsevier Science Publishers, Amsterdam (2001)

    Google Scholar 

  32. Schrijver, A.: Theory of Linear and Integer Programming. Wiley and Sons, Chichester (1986)

    MATH  Google Scholar 

  33. Sivignon, I., Coeurjolly, D.: From digital plane segmentation to polyhedral representation. In: Asano, T., Klette, R., Ronse, C. (eds.) Geometry, Morphology, and Computational Imaging. LNCS, vol. 2616, pp. 356–367. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  34. Sivignon, I., Dupont, F., Chassery, J.M.: Decomposition of a three-dimensional discrete object surface into discrete plane pieces. Algorithmica 38(1), 25–43 (2003)

    Article  MathSciNet  Google Scholar 

  35. Stojmenović, I., Tosić, R.: Digitization schemes and the recognition of digital straight lines, hyperplanes and flats in arbitrary dimensions. In: Vision Geometry, contemporary Mathematics Series, vol. 119, pp. 197–212. American Mathematical Society, Providence (1991)

    Google Scholar 

  36. Veelaert, P.: On the flatness of digital hyperplanes. Journal of Mathematical Imaging and Vision 3, 205–221 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  37. Veelaert, P.: Digital planarity of rectangular surface segments. IEEE Pattern Analysis and Machine Intelligence 16(6), 647–652 (1994)

    Article  Google Scholar 

  38. Vittone, J., Chassery, J.-M.: Recognition of digital naive planes and polyhedization. In: Nyström, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol. 1953, pp. 296–307. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  39. Zolotykh, N.Y.: On the number of vertices in integer linear programming problems. Technical report, University of Nizhni Novgorod (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LIRIS – CNRS UMR 5205, Université Claude Bernard Lyon1, 43 Bd du 11 novembre 1918, Villeurbanne, France

    David Coeurjolly

  2. Mathematics Department, Buffalo State College, State University of New York, Buffalo, NY, 14222, USA

    Valentin Brimkov

Authors
  1. David Coeurjolly
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valentin Brimkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Transport Research, German-Aerospace Center (DLR), Rutherfordstr. 2, 12489, Berlin, Germany

    Ralf Reulke

  2. Fachbereich Mathematik, Universität Hamburg, Bundesstr. 55, 20146, Hamburg

    Ulrich Eckardt

  3. Dresden University of Technology,  

    Boris Flach

  4. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Uwe Knauer

  5. FU Berlin, Arnimallee 3, 14195, Berlin, Germany

    Konrad Polthier

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coeurjolly, D., Brimkov, V. (2006). Computational Aspects of Digital Plane and Hyperplane Recognition. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds) Combinatorial Image Analysis. IWCIA 2006. Lecture Notes in Computer Science, vol 4040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11774938_23

Download citation

  • DOI: https://doi.org/10.1007/11774938_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35153-5

  • Online ISBN: 978-3-540-35154-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics