Polyhedra generation from lattice points

  • Yukiko Kenmochi
  • Atsushi Imiya
  • Norberto F. Ezquerra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1176)


This paper focuses on a method for generating polyhedra from a set of lattice points, such as three-dimensional (3D) medical computerized tomography images. The method is based on combinatorial topology [1] and algebraic properties of the 3D lattice space [2]. It is shown that the method can uniquely generate polyhedra from a subset of the lattice space independently of the choice of neighborhood. Furthermore, a practical algorithm is developed and experimental results using 3D medical imagery are presented.

Key words

Polyhedra lattice space topology boundary detection medical images 


  1. 1.
    P. S. Aleksandrov, Combinatorial Topology, Vol. 1, Graylock Press, Rochester, NY, 1956.Google Scholar
  2. 2.
    A. Imiya, Structure of 3-dimensional Digital Neighborhood and Its Application (in Japanese), Information Processing Society Journal, Vol. 34, pp. 2153–2164, Information Processing Society of Japan, 1993.Google Scholar
  3. 3.
    A. A. G. Requicha and H. B. Voelcker, Solid Modeling: A Historical Summary and Contemporary Assessment, IEEE Computer Graphics and Applications, Vol. 2, No. 2, pp. 9–24, 1982.Google Scholar
  4. 4.
    M. Chao, Y. Shen and W. Zhao, Solid Modeling Based on Polyhedron Approach, Computers and Graphics, Vol. 16, pp. 101–105, 1992.Google Scholar
  5. 5.
    S. N. Srihari, Representation of Three Dimensional Digital Images, Computing Surveys, Vol. 13, pp. 399–424, 1981.Google Scholar
  6. 6.
    J. D. Foley, A. V. Dam, S. T. Feiner and J. F. Hughes, Computer Graphics, Addison-Wesley, Reading, MA, 1995.Google Scholar
  7. 7.
    W. E. Lorensen and H. E. Cline, Marching Cubes: A High-resolution 3D Surface Construction Algorithm, Computer Graphics (SIGGRAPH '87), Vol. 21, pp. 163–169, 1988.Google Scholar
  8. 8.
    T. Y. Kong and A. Rosenfeld, Digital Topology: Introduction and Survey, Computer Vision, Graphics, and Image Processing, Vol. 48, pp. 357–393, 1989.Google Scholar
  9. 9.
    V. A. Kovalevsky, Finite Topology as Applied to Image Analysis, Computer Vision, Graphics, and Image Processing, Vol. 46, pp. 141–161, 1989.Google Scholar
  10. 10.
    G. T. Herman, Discrete Multidimensional Jordan surfaces, CVGIP: Graphical Models and Image Processing, Vol. 54, pp. 507–515, 1992.Google Scholar
  11. 11.
    J. K. Udupa, Multidimensional Digital Boundaries, CVGIP: Graphical Models and Image Processing, Vol. 56, pp. 311–323, 1994.Google Scholar
  12. 12.
    J. Françon, Discrete Combinatorial Surfaces, CVGIP: Graphical Models and Image Processing, Vol. 57, pp. 20–26, 1995.Google Scholar
  13. 13.
    Y. Kenmochi, A. Imiya and A. Ichikawa, Discrete Combinatorial Geometry (submitted).Google Scholar
  14. 14.
    E. Lee, Y. Choi and K. H. Park, A Method of 3D Object Reconstruction from a Series of Cross-Sectional Images, IEICE Transactions on Information and Systems, Vol. E77-D, pp. 996–1004, 1994.Google Scholar
  15. 15.
    H. S. M. Coxeter, Regular Polytopes, Dover Publications, New York, 1973.Google Scholar
  16. 16.
    N. Otsu, A Threshold Selection Method from Gray-Level Histograms, IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-9, pp. 62–66, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Yukiko Kenmochi
    • 1
  • Atsushi Imiya
    • 1
  • Norberto F. Ezquerra
    • 2
  1. 1.Dept. of Information & Computer SciencesChiba UniversityChibaJapan
  2. 2.Graphics, Visualization & Usability Center, College of ComputingGeorgia Institute of TechnologyAtlantaUS

Personalised recommendations