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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00185161
Contributor : David Coeurjolly <>
Submitted on : Tuesday, November 6, 2007 - 9:13:42 AM
Last modification on : Thursday, February 7, 2019 - 3:00:58 PM
Long-term archiving on : Monday, April 12, 2010 - 1:20:06 AM

File

reversible.pdf
Publisher files allowed on an open archive

Identifiers

Citation

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⟩

Share

Metrics

Record views

289

Files downloads

147