Discrete Polyhedrization of a Lattice Point Set

Authors:
Yukiko Kenmochi;Atsushi Imiya
Affiliations:
-;-
Venue:
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Year:
2001

Citing 7
Cited 1

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)

Getting Topological Information for a 80-Adjacency Doxel-Based 4D Volume through a Polytopal Cell Complex

CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications

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 basedon 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.