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) surface, a digital plane segmentation of the binary object surface and an optimization step to simplify the MC surface using the segmentation information. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Coeurjolly, D., Dupont, F., Jospin, L., & Sivignon, I. (2006). Optimization schemes for the reversible discrete volume polyhedrization using marching cubes simplification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4245 LNCS, pp. 413–424). Springer Verlag. https://doi.org/10.1007/11907350_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
