We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2-manifolds. Our algorithm uses hierarchical simplifications to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. This initial parameterization is further improved through a hierarchical smoothing procedure based on Loop subdivision applied in the parameter domain. Our method supports both fully automatic and user constrained operations. In the latter, we accommodate point and edge constraints to forst the alignment of iso-parameter lines with desired features. We show how to use the parameterization for fast, hierarchical subdivision connectivity remeshing with guaranteed error bounds. The remeshing algorithm constructs an adaptively subdivided mesh directly without first resorting to uniform subdivision followed by subsequent sparsification. It thus avoids the exponential cost of the latter. Our parameterizations are also useful for texture mapping and morphing applications, among others.

@inproceedings{Lee:1998:MMA,
   author = "Aaron W. F. Lee and Wim Sweldens and Peter Schr{\"o}der and Lawrence
      Cowsar and David Dobkin",
   title = "{MAPS}: Multiresolution Adaptive Parameterization of Surfaces",
   booktitle = "Proceedings of SIGGRAPH 98",
   year = "1998",
   month = jul,
   pages = "95--104"
}