Variational shape approximation

  • Authors:
  • David Cohen-Steiner;Pierre Alliez;Mathieu Desbrun

  • Affiliations:
  • Duke University;INRIA;University of Southern California

  • Venue:
  • ACM SIGGRAPH 2004 Papers
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A method for concise, faithful approximation of complex 3D datasets is key to reducing the computational cost of graphics applications. Despite numerous applications ranging from geometry compression to reverse engineering, efficiently capturing the geometry of a surface remains a tedious task. In this paper, we present both theoretical and practical contributions that result in a novel and versatile framework for geometric approximation of surfaces. We depart from the usual strategy by casting shape approximation as a variational geometric partitioning problem. Using the concept of geometric proxies, we drive the distortion error down through repeated clustering of faces into best-fitting regions. Our approach is entirely discrete and error-driven, and does not require parameterization or local estimations of differential quantities. We also introduce a new metric based on normal deviation, and demonstrate its superior behavior at capturing anisotropy.