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

DOI10.1007/11907350_35MaRDI QIDQ5386042zbMATH OpenOpenAlexFDO

Authors David Coeurjolly, Florent Dupont, Laurent Jospin, Isabelle Sivignon

Publication date 17 April 2008

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11907350_35

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Remeshing triangulated surfaces with optimal parameterizations
• Optimization-based mesh correction with volume and convexity constraints
• Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
• Shape reconstruction and volume meshing for complex solids
• Gregory solid construction for polyhedral volume parameterization by sparse optimization
• Marching triangle polygonization for efficient surface reconstruction from its distance transform

Cited in

(5)

• 3D noisy discrete objects: Segmentation and application to smoothing
• From digital plane segmentation to polyhedral representation
• Discrete Geometry for Computer Imagery
• On the polyhedral complexity of the integer points in a hyperball
• Some theoretical challenges in digital geometry: a perspective

This page was built for publication: Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386042)