Technical Papers

Geometry Processing

Tuesday, 12 August 10:45 AM - 12:15 PM | Vancouver Convention Centre, East Building, Ballroom A Session Chair: Mario Botsch, Universität Bielefeld

Earth Mover's Distances on Discrete Surfaces

Efficient methods for computing an earth mover's distance (EMD) between distributions on a discrete surface using a differential formulation. The approach applies EMD to problems in graphics and geometry, including computation of distances along the surface extendable to points in the surrounding volume, path planning, and barycenter computation.

Justin Solomon
Stanford University

Raif Rustamov
Stanford University

Leonidas Guibas
Stanford University

Adrian Butscher
Max Planck Center for Visual Computing and Communication

Controlling Singular Values With Semidefinite Programming

This method for optimizing problems expressed in terms of singular values of matrices introduces a formulation that uses a sequence of convex semidefinite programs for their optimization. The approach is demonstrated in applications of geometry processing including mesh deformation, surface registration, and averaging of rotations.

Shahar Kovalsky
Weizmann Institute of Science

Noam Aigerman
Weizmann Institute of Science

Ronen Basri
Weizmann Institute of Science

Yaron Lipman
Weizmann Institute of Science

Lifted Bijections for Low-Distortion Surface Mappings

An algorithm for generating provably bijective, low-distortion mappings between surfaces from a coarse set of correspondences. The algorithm stems from novel observations regarding lifting bijections from non-bijective simultaneuos flattenings and an efficient way to minimize the isometric distortion.

Noam Aigerman
The Weizmann Institute Of Science

Roi Poranne
The Weizmann Institute Of Science

Yaron Lipman
The Weizmann Institute Of Science

Parallel Chen-Han (PCH) Algorithm for Discrete Geodesics

The parallel Chen-Han (PCH) algorithm extends the classic discrete geodesic algorithm to the parallel setting. The proposed algorithm is able to propagate a large number of windows simultaneously and independently, which is a one-order-of-magnitude improvement in execution time compared to the state of the art.

Xiang Ying
Nanyang Technological University

Shi-Qing Xin
Nanyang Technological University

Ying He
Nanyang Technological University

Form-Finding with Polyhedral Meshes Made Simple

A solution for the form-finding problem for polyhedral meshes that combines form, function, and fabrication within constraints such as boundary alignment, planarity of faces, panel sizes, and statics. The main application is interactive modeling of meshes for architectural and industrial design.

Chengcheng Tang
King Abdullah University of Science and Technology

Xiang Sun
King Abdullah University of Science and Technology

Alexandra Gomes
Instituto Superior Técnico

Johannes Wallner
Technische Universität Graz

Helmut Pottmann
King Abdullah University of Science and Technology, Technische Universität Wien