Base mesh construction using global parametrization

  • Authors:
  • Francisco Ganacim;André Maximo;Luiz Velho

  • Affiliations:
  • VISGRAF Lab, IMPA, Rio de Janeiro, Brazil;VISGRAF Lab, IMPA, Rio de Janeiro, Brazil;VISGRAF Lab, IMPA, Rio de Janeiro, Brazil

  • Venue:
  • ACM SIGGRAPH 2012 Posters
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Base mesh construction from a dense-polygon mesh is often used to reduce the complexity of geometry processing problems. In the base or control mesh, each face corresponds to a region on the original surface and is used to encode its geometry. This encoding can involve a different representation of the surface, e.g. using displacement field and subdivision surfaces [Lee et al. 2000], or can be a more direct representation, e.g. through charts [Sander et al. 2003]. In the former example, the control mesh is constructed using edge-collapse simplification, and in the latter by an iterative seed-placement and chart-growth optimization process. Although both methods strive to optimize this construction, the first implies a sequence of local operations, lacking a global strategy, and the second iterates over greedy choices, which may not converge to a global solution.