Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification

Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification

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) surface, a digital plane segmentation of the binary object surface and an optimization step to simplify the MC surf...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Coeurjolly, David, Dupont, Florent, Jospin, Laurent, Sivignon, Isabelle
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Artificial intelligence
Computer Science
Computer science
control theory
systems
Discrete Object
Discrete Volume
Euclidean Plane
Exact sciences and technology
Image Processing
Linear Constraint
Marching Cube
Pattern recognition. Digital image processing. Computational geometry
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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) surface, a digital plane segmentation of the binary object surface and an optimization step to simplify the MC surface using the segmentation information.
ISSN:0302-9743
1611-3349
DOI:10.1007/11907350_35