Gift-Wrapping Based Preimage Computation Algorithm

  • Yan Gerard
  • Fabien Feschet
  • David Coeurjolly
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4992)


The aim of the paper is to define an algorithm for computing preimages - roughly the sets of naive digital planes containing a finite subset S of ℤ3. The method is based on theoretical results: the preimage is a polytope that vertices can be decomposed in three subsets, the upper vertices, the lower vertices and the intermediary ones (equatorial). We provide a geometrical understanding (as facets on S or S ⊝ S) of each kind of vertices. These properties are used to compute the preimage by gift-wrapping some regions of the convex hull of S or of S ⊝ S ∪ {(0,0,1)}.


Convex Hull Double Inequality Discrete Apply Mathematic Visibility Cone Digital Plane 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    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
  2. 2.
    Dorst, L., Smeulders, A.N.M.: Discrete representation of straight lines. IEEE Trans. on Pattern Analysis and Machine Intelligence 6, 450–463 (1984)zbMATHCrossRefGoogle Scholar
  3. 3.
    McIlroy, M.D.: A note on discrete representation of lines. AT&T Technical Journal 64(2), 481–490 (1985)Google Scholar
  4. 4.
    Lindenbaum, M., Bruckstein, A.: On recursive, O(n) partitioning of a digitized curve into digital straigth segments. IEEE Trans. on Pattern Analysis and Machine Intelligence 15(9), 949–953 (1993)CrossRefGoogle Scholar
  5. 5.
    Brimkov, V., Coeurjolly, D., Klette, R.: Digital planarity - a review. Discrete Applied Mathematics (2006)Google Scholar
  6. 6.
    Veelaert, P.: Geometric constructions in the digital plane. Journal of Mathematical Imaging and Vision 11, 99–118 (1999)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Dexet, M., Andres, E.: A generalized preimage for the standard and supercover digital hyperplane recognition. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 639–650. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefMathSciNetzbMATHGoogle Scholar
  10. 10.
    Coeurjolly, D., Brimkov, V.: Computational aspects of digital plane and hyperplane recognition. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWCIA 2006. LNCS, vol. 4040, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Gérard, Y., Debled-Rennesson, I., Zimmermann, P.: An elementary digital plane recognition algorithm. Discrete Applied Mathematics 151, 169–183 (2005)CrossRefMathSciNetzbMATHGoogle Scholar
  12. 12.
    Reveillès, J.P.: Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d’etat, Université Louis Pasteur, Strasbourg, France (1991)Google Scholar
  13. 13.
    Preparata, F.P., Shamos, M.I.: Computational Geometry : An Introduction. Springer, Heidelberg (1985)Google Scholar
  14. 14.
    de Berg, M., Schwarzkopf, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)zbMATHGoogle Scholar
  15. 15.
    Sivignon, I.: De la caractérisation des primitives à reconstruction polyhèdrique de surfaces en géométrie discrète. PhD thesis, Laboratoire des Images et des Signaux, INPG, Grenoble (2004)Google Scholar
  16. 16.
    Avis, D.: lrs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm (1999),

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Yan Gerard
    • 1
  • Fabien Feschet
    • 1
  • David Coeurjolly
    • 2
  1. 1.LAICUniv. Clermont 1AubièreFrance
  2. 2.LIRISUniv. Lyon 1, Bât NautibusVilleurbanne CedexFrance

Personalised recommendations