Optimization schemes for the reversible discrete volume polyhedrization using Marching Cubes simplification - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Optimization schemes for the reversible discrete volume polyhedrization using Marching Cubes simplification

Abstract

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.
Fichier principal
Vignette du fichier
reversible.pdf (428.62 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

hal-00185161 , version 1 (06-11-2007)

Identifiers

Cite

David Coeurjolly, Florent Dupont, Laurent Jospin, Isabelle Sivignon. Optimization schemes for the reversible discrete volume polyhedrization using Marching Cubes simplification. International Conference on Discrete Geometry for computer Imagery, Oct 2006, Szeged, Hungary. pp.413--424, ⟨10.1007/11907350_35⟩. ⟨hal-00185161⟩
164 View
130 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More