Blended intrinsic maps

Abstract

This paper describes a fully automatic pipeline for finding an intrinsic map between two non-isometric, genus zero surfaces. Our approach is based on the observation that efficient methods exist to search for nearly isometric maps (e.g., Möbius Voting or Heat Kernel Maps), but no single solution found with these methods provides low-distortion everywhere for pairs of surfaces differing by large deformations. To address this problem, we suggest using a weighted combination of these maps to produce a "blended map." This approach enables algorithms that leverage efficient search procedures, yet can provide the flexibility to handle large deformations.

Document Details

Document Type
Pub Defense Publication
Publication Date
Jul 01, 2011
Source ID
10.1145/2010324.1964974

Entities

People

  • Thomas Funkhouser
  • Vladimir G. Kim
  • Yaron Lipman

Organizations

  • Air Force Office of Scientific Research
  • Division of Computer and Network Systems
  • Division of Computing and Communication Foundations
  • Division of Information and Intelligent Systems
  • Princeton University

Tags

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.