Skip to main content

On the Language of Standard Discrete Planes and Surfaces

  • Conference paper
Combinatorial Image Analysis (IWCIA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3322))

Included in the following conference series:

Abstract

A standard discrete plane is a subset of ℤ3 verifying the double Diophantine inequality μax + by + cz < μ + ω, with (a,b,c) ≠ (0,0,0). In the present paper we introduce a generalization of this notion, namely the (1,1,1)-discrete surfaces. We first study a combinatorial representation of discrete surfaces as two-dimensional sequences over a three-letter alphabet and show how to use this combinatorial point of view for the recognition problem for these discrete surfaces. We then apply this combinatorial representation to the standard discrete planes and give a first attempt of to generalize the study of the dual space of parameters for the latter [VC00].

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnoux, P., Berthé, V., Siegel, A.: Two-dimensional iterated morphisms and discrete planes. Theoretical Computer Science 319, 145–176 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Andrès, É.: Le plan discret. In: Colloque de géométrie discrète en imagerie: fondements et applications (September 1993)

    Google Scholar 

  3. Brimkov, V., Coeurjolly, D., Klette, R.: Digital planarity - a review. Technical Report RR2004-24, Laboratoire LIRIS - Université Lumière Lyon 2 (May 2004)

    Google Scholar 

  4. Buzer, L.: An incremental linear time algorithm for digital line and plane recognition using a linear incremental feasibility problem. In: Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery, pp. 372–381. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Berthé, V., Tijdeman, R.: Lattices and multi-dimensional words. Theoretical Computer Science 319, 177–202 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Berthé, V., Vuillon, L.: Suites doubles de basse complexité. Journal de Théorie des Nombres de Bordeaux 12, 179–208 (2000)

    MATH  Google Scholar 

  7. Berthé, V., Vuillon, L.: Tilings and rotations on the torus: a two-dimensional generalization of sturmian sequences. Discrete Mathematics 223, 27–53 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Jacob-Da Col, M.A.: About local configurations in arithmetic planes. Theor. Comput. Sci. 283(1), 183–201 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Debled-Rennesson, I., Réveillès, J.P.: Incremental algorithm for recognizing pieces of digital planes. In: Melter, R.A., Wu, A.Y., Latecki, L. (eds.) SPIE Proceedings of Vision Geometry V, August 1996, vol. 2826, pp. 140–151 (1996)

    Google Scholar 

  10. Françon, J.: Discrete combinatorial surfaces. Graph. Models Image Process 57(1), 20–26 (1995)

    Article  Google Scholar 

  11. Gérard, Y.: Local configurations of digital hyperplanes. In: Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery, pp. 65–75. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  12. Kenmochi, Y., Imiya, A.: Naive planes as discrete combinatorial surfaces. In: Nyström, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol. 1953, pp. 249–261. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Lothaire: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  14. Malgouyres, R.: A definition of surfaces of Z 3. a new 3d discrete jordan theorem. Theor. Comput. Sci. 186(1-2), 1–41 (1997)

    MATH  MathSciNet  Google Scholar 

  15. Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM 31(1), 114–127 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  16. Preparata, F.P., Shamos, M.I.: Computational geometry: an introduction. Springer, Heidelberg (1985)

    Google Scholar 

  17. Réveillès, J.P.: Géométrie discète, calcul en nombres entiers et algorithmique. PhD thesis, Université Louis Pasteur, Strasbourg (1991)

    Google Scholar 

  18. Rosenfeld, A., Kong, T.Y., Wu, A.Y.: Digital surfaces. CVGIP: Graph. Models Image Process 53(4), 305–312 (1991)

    Article  MATH  Google Scholar 

  19. Vittone, J., Chassery, J.M.: (n, m)-cubes and farey nets for naive planes understanding. In: Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery, pp. 76–90. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. Vittone, J., Chassery, J.M.: Recognition of digital naive planes and polyhedrization. In: DGCI: International Workshop on Discrete Geometry for Computer Imagery, pp. 297–307 (2000)

    Google Scholar 

  21. Vuillon, L.: Combinatoire des motifs d’une suite sturmienne bidimensionnelle. Theor. Comput. Sci. 209(1-2), 261–285 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jamet, D. (2004). On the Language of Standard Discrete Planes and Surfaces. In: Klette, R., Žunić, J. (eds) Combinatorial Image Analysis. IWCIA 2004. Lecture Notes in Computer Science, vol 3322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30503-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30503-3_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23942-0

  • Online ISBN: 978-3-540-30503-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics