Item

Abstract

We present an efficient approach for solving the spherical parameterization
problem. The essence of the approach is to look for a solution in the
curvilinear coordinate system, without requiring the additional spherical
constraints usually needed in cartesian formulations. This setup allows us to
take full advantage of some existing techniques originally developed for planar
parameterization. Our results substantiate the efficiency of the method and
confirm its robustness. Meshes of non-trivial geometry with tens of thousands
of triangles are processed in a few seconds, always yielding bijective maps.
This computational achievement bridges a so far wide gap in performance between
spherical and planar parameterization.