Soft maps between surfaces

AbstractThe problem of mapping between two non-isometric surfaces admits ambiguities on both local and global scales. For instance, symmetries can make it possible for multiple maps to be equally acceptable, and stretching, slippage, and compression introduce difficulties deciding exactly where each point should go. Since most algorithms for point-to-point or even sparse mapping struggle to resolve these ambiguities, in this paper we introduce soft maps, a probabilistic relaxation of point-to-point correspondence that explicitly incorporates ambiguities in the mapping process. In addition to explaining a continuous theory of soft maps, we show how they can be represented using probability matrices and computed for given pairs of surfaces through a convex optimization explicitly trading off between continuity, conformity to geometric descriptors, and spread. Given that our correspondences are encoded in matrix form, we also illustrate how low-rank approximation and other linear algebraic tools can be used to analyze, simplify, and represent both individual and collections of soft maps.

Download publication

Related Resources

See what’s new.



Multiple scattering as a diffusion process

Multiple scattering in participating media is generally a complex…



Real-Time Fluid Dynamics for Games

In this paper we present a simple and rapid implementation of a fluid…



Ivy: Exploring Spatially Situated Visual Programming for Authoring and Understanding Intelligent Environments

The availability of embedded, digital systems has led to a multitude…



A Natural Language Approach to Biomimetic Design

Identifying relevant analogies from biology is a significant challenge…

Get in touch

Something pique your interest? Get in touch if you’d like to learn more about Autodesk Research, our projects, people, and potential collaboration opportunities.

Contact us