Back to Search
Start Over
Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
- Source :
- Discrete Geometry for Computer Imagery ISBN: 9783540476511, DGCI, International Conference on Discrete Geometry for computer Imagery, International Conference on Discrete Geometry for computer Imagery, Oct 2006, Szeged, Hungary. pp.413--424, ⟨10.1007/11907350_35⟩, Scopus-Elsevier
- Publication Year :
- 2006
- Publisher :
- Springer Berlin Heidelberg, 2006.
-
Abstract
- International audience; The aim of this article is to present a reversible and topologically correct construction of a polyhedron from a binary object. The proposed algorithm is based on a Marching Cubes (MC for short) surface, a digital plane segmentation of the binary object surface and an optimization step to simplify the MC surface using the segmentation information.
- Subjects :
- Binary Object
Marching cubes
Discretization
Computer science
ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION
Discrete geometry
0102 computer and information sciences
02 engineering and technology
Topology
01 natural sciences
Marching tetrahedra
Polyhedron
010201 computation theory & mathematics
[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]
Isosurface
Euclidean geometry
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
Cube
Algorithm
ComputingMethodologies_COMPUTERGRAPHICS
Subjects
Details
- ISBN :
- 978-3-540-47651-1
- ISBNs :
- 9783540476511
- Database :
- OpenAIRE
- Journal :
- Discrete Geometry for Computer Imagery ISBN: 9783540476511, DGCI, International Conference on Discrete Geometry for computer Imagery, International Conference on Discrete Geometry for computer Imagery, Oct 2006, Szeged, Hungary. pp.413--424, ⟨10.1007/11907350_35⟩, Scopus-Elsevier
- Accession number :
- edsair.doi.dedup.....d4f57c2ebcb3667169fa231e2397a995
- Full Text :
- https://doi.org/10.1007/11907350_35