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.
Domains
Image Processing [eess.IV]Origin | Publisher files allowed on an open archive |
---|