Discrete polyhedrization of a lattice point set

Authors:
Yukiko Kenmochi;Atsushi Imiya
Affiliations:
Laboratoire A2SI, ESIEE, Cité Descartes, B. P. 99, 93162 Noisy-Le-Grand Cedex, France;Institute of Media and Information Technology, Chiba University 1-33 Yayoi-cho Inage-ku 263-8522 Chiba, Japan
Venue:
Digital and image geometry
Year:
2001

Citing 7
Cited 0

Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Finite topology as applied to image analysis

Computer Vision, Graphics, and Image Processing
Digital topology: introduction and survey

Computer Vision, Graphics, and Image Processing
Discrete Combinatorial Surfaces

Graphical Models and Image Processing
Boundary extraction of discrete objects

Computer Vision and Image Understanding
Connectivity in Digital Pictures

Journal of the ACM (JACM)
Some Results in Computational Topology

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a polyhedral representation of surfaces for analysis and recognition of three-dimensional digital images. Our representation is based on combinatorial topology. By using a discrete version of combinatorial topology we also present an algorithm for reconstruction of a polyhedron in a discrete space from a set of lattice points.