Meshing Around

Technical Papers

Meshing Around

Tuesday, 11 August 10:45 AM - 12:15 PM | Los Angeles Convention Center, Room 152 Session Chair: Leif Kobbett, Rheinisch-Westfälische Technische Hochschule Aachen


Isotopic Approximation Within a Tolerance Volume

This novel approach for surface approximation within a tolerance volume takes as input a tolerance volume around a surface geometry and generates as output a surface triangle mesh guaranteed to be within the tolerance, intersection-free, and homotopy-equivalent to the tolerance volume.

Manish Mandad
INRIA Sophia Antipolis

David Cohen-Steiner
INRIA Sophia Antipolis

Pierre Alliez
INRIA Sophia Antipolis

Data-Driven Interactive Quadrangulation

An interactive quadrangulation method based on a large collection of patterns learned from models and stored in a database. The user can sketch patches on the surface and specify their internal flows; the database is queried in real time to extract suitable patterns to tessellate such patches.

Giorgio Marcias
Istituto di Scienza e Tecnologie dell'Informazione

Kenshi Takayama
National Institute of Informatics

Nico Pietroni
Istituto di Scienza e Tecnologie dell'Informazione

Daniele Panozzo
ETH Zürich

Olga Sorkine-Hornung
ETH Zürich

Enrico Puppo
Università degli Studi di Genova

Paolo Cignoni
Istituto di Scienza e Tecnologie dell'Informazione

Spectral Quadrangulation With Feature-Curve Alignment and Element-Size Control

A spectral-based quadrangulation method with novel boundary conditions and vibration-enhancement techniques, which achieves tight feature alignment and flexible local size control.

Jin Huang
Zhejiang University

Ruotian Ling
The University of Hong Kong

Bert Juttler
Johannes Kepler Universität Linz

Feng Sun
The University of Hong Kong

Hujun Bao
Zhejiang University

Wenping Wang
The University of Hong Kong

Convolutional Wasserstein Distances: Efficient Optimal Transportation on Geometric Domains

This paper introduces a new class of algorithms for optimization problems involving optimal transportation over geometric domains. The main contribution is to show that optimal transportation can be made tractable over large graphics domains, such as images and triangle meshes, improving performance by orders of magnitude compared to previous work.

Justin Solomon
Stanford University

Fernando de Goes
Pixar Animation Studios

Gabriel Peyré
Université Paris-Dauphine

Marco Cuturi
Kyoto University

Adrian Butscher
Autodesk, Inc.

Andy Nguyen
Stanford University

Tao Du
Stanford University

Leonidas Guibas
Stanford University