Polyhedrization of the Boundary of a Voxel Object

  • Jean Françon
  • Laurent Papier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1568)

Abstract

A voxel object (finite set of voxels) is considered in the cuberille approach (more precisely, the 3D cell complex approach). Its boundary is a set of surfels (faces of voxels). We assume, without loss of generality, that this set of surfels is a polyhedron whose faces are surfels. These faces can be agglomerated in such a way that the boundary is a polyhedron whose faces are topological disks of standard arithmetic planes; this new kind of polyhedron is called a discrete standard polyhedron. Thus, these new faces are generally much bigger than one surfel, and a discrete standard polyhedron has generally a less smaller space complexity than the starting set of surfels. This process, called polyhedrization or facetization, is the 3D extension of the known polygonalization of 2D discrete curves. The other main properties of this polyhedrization are the non-uniqueness, and the reversibility, i.e. starting from the discrete standard polyhedron, the boundary can be exactly computed back again. A polyhedrization algorithm is presented in this paper. It uses a recent algorithm for recognizing standard arithmetic planes. Examples of polyhedrizations of synthetic and natural objects are given. Examples of application to the visualization of the boundary of a voxel object are also given.

Keywords

Standard Plane Topological Disk Digital Plane Standard Face Current Face 
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.

References

  1. 1.
    Borianne, Ph., Françon, J.: Reversible polyhedrization of discrete volumes. 4th DGCI Conference, Grenoble, September 19-21, 1994.Google Scholar
  2. 2.
    Debled, I., Reveillès, J.-P.: Un algorithme linéaire de polygonalisation de courbes discrètes. 2nd DGCI Conference, Grenoble, 17-18 September, 1992.Google Scholar
  3. 3.
    Debled, I., Reveillès, J.-P.: A new approach to digital planes. Vision Geometry III, Boston, 31 October-4 November 1994.Google Scholar
  4. 4.
    Debled, I., Reveillès, J.-P.: An incremental algorithm for digital plane recognition. 4th DGCI Conference, Grenoble, September 19-21, 1994.Google Scholar
  5. 5.
    Debled, I.: Etude et reconnaissance de droites et plans discrets. Thèse de l’Université Louis Pasteur, Strasbourg, December 1995.Google Scholar
  6. 6.
    Françon, J.: Discrete combinatorial surfaces. Graphical Models and Image Processing, 57, pp. 20–26, 1995.CrossRefGoogle Scholar
  7. 7.
    Françon, J.: Arithmetic planes and combinatorial manifolds. 5th DGCI Conference, Clermont-Ferrand, September 25-27, 1995.Google Scholar
  8. 8.
    Françon, J.: Sur la topologie d’un plan arithmétique. Theor. Comp. Sc.156, pp. 159–176, 1996.MATHCrossRefGoogle Scholar
  9. 9.
    Françon, J., Schramm, J.-M., Tajine, M.: Recognizing arithmetic straight lines and planes. Proc. Int. Workshop on Discrete Geometry for Computer Imagery (6th DGCI Conference), LNCS1176, Springer, 1996.Google Scholar
  10. 10.
    Kovalevsky, V.: Finite topology as applied to image processing. CVGIP46, pp. 141–161, 1989.Google Scholar
  11. 11.
    Kovalevsky, V.: Applications of digital straight segments to economical image encoding. Proc. Int. Workshop on Discrete Geometry for Computer Imagery (7th DGCI Conference), LNCS1347, Springer, 1997.Google Scholar
  12. 12.
    Papier, L.: Polyédrisation et visualisation du bord des objets voxels. Thèse de léUniversité Louis Pasteur, Strasbourg (in preparation).Google Scholar
  13. 13.
    Papier, L., Françon, J: Evaluation de la normale au bord d’un objet discret 3D. Revue internationale de CFAO et d’Infographie, to appear.Google Scholar
  14. 14.
    Reveillès, J.P.: Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d’ état soutenue à l’Université Louis Pasteur, Strasbourg, December 1991.Google Scholar
  15. 15.
    Vialard, A.: Geometrical parameters extraction from discrete pathes. Proc. Int. Workshop on Discrete Geometry for Computer Imagery (6th DGCI Conference), LNCS1176, Springer, 1996.Google Scholar
  16. 16.
    Vialard, A.: Chemins euclidiens: Un modèle de représentation des contours discrets. Thèse de l’Université de Bordeaux I, December 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Jean Françon
    • 1
  • Laurent Papier
    • 1
  1. 1.d’Informatique et de TélédétectionLaboratoire des Sciences de l’ImageIllkirchFrance

Personalised recommendations