INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.

Slides:



Advertisements
Similar presentations
L1 sparse reconstruction of sharp point set surfaces
Advertisements

As-Rigid-As-Possible Surface Modeling
Computer Graphics Lecture 4 Geometry & Transformations.
Synchronized Multi-character Motion Editing Manmyung Kim, Kyunglyul Hyun, Jongmin Kim, Jehee Lee Seoul National University.
Least-squares Meshes Olga Sorkine and Daniel Cohen-Or Tel-Aviv University SMI 2004.
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 9: Extrinsic Deformations Fall 2012.
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 10: Extrinsic Deformations Fall 2014.
High-Pass Quantization for Mesh Encoding Olga Sorkine, Daniel Cohen-Or, Sivan Toledo Eurographics Symposium on Geometry Processing, Aachen 2003.
Interactive Inverse 3D Modeling James Andrews Hailin Jin Carlo Séquin.
2D/3D Shape Manipulation, 3D Printing
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
A Sketch-Based Interface for Detail-Preserving Mesh Editing Andrew Nealen Olga Sorkine Marc Alexa Daniel Cohen-Or.
Polygonal Mesh – Data Structure and Smoothing
Real-time Combined 2D+3D Active Appearance Models Jing Xiao, Simon Baker,Iain Matthew, and Takeo Kanade CVPR 2004 Presented by Pat Chan 23/11/2004.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
FiberMesh: Designing Freeform Surfaces with 3D Curves
© 2003 by Davi GeigerComputer Vision October 2003 L1.1 Structure-from-EgoMotion (based on notes from David Jacobs, CS-Maryland) Determining the 3-D structure.
3D Geometry for Computer Graphics
Andrew Nealen, TU Berlin, CG 11 Andrew Nealen TU Berlin Takeo Igarashi The University of Tokyo / PRESTO JST Olga Sorkine Marc Alexa TU Berlin Laplacian.
Der, Sumner, and Popović Inverse Kinematics for Reduced Deformable Models Kevin G. Der Robert W. Sumner 1 Jovan Popović Computer Science and Artificial.
Defining Point Set Surfaces Nina Amenta and Yong Joo Kil University of California, Davis IDAV Institute for Data Analysis and Visualization Visualization.
Computer Graphics Recitation The plan today Least squares approach  General / Polynomial fitting  Linear systems of equations  Local polynomial.
1 Dr. Scott Schaefer Generalized Barycentric Coordinates.
CSE554SimplificationSlide 1 CSE 554 Lecture 7: Simplification Fall 2014.
Interactive Reflection Editing Tobias Ritschel Makoto Okabe Thorsten Thormählen Hans-Peter Seidel Max-Planck-Institut Informatik SIGGRAPH Asia 2009 Friday,
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Laplacian Surface Editing
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
Shape Blending Joshua Filliater December 15, 2000.
Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
CS 551/651 Advanced Computer Graphics Warping and Morphing Spring 2002.
1 Dr. Scott Schaefer Generalized Barycentric Coordinates.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
Recent Work on Laplacian Mesh Deformation Speaker: Qianqian Hu Date: Nov. 8, 2006.
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
Shape Deformation Reporter: Zhang, Lei 5/30/2006.
2012/4/11 Olga Sorkine Tel Aviv University Daniel Cohen-Or Tel Aviv University presented by sunwei.
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Spectral surface reconstruction Reporter: Lincong Fang 24th Sep, 2008.
CSE554SimplificationSlide 1 CSE 554 Lecture 7: Simplification Fall 2013.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
CSE554Fairing and simplificationSlide 1 CSE 554 Lecture 6: Fairing and Simplification Fall 2012.
AS-RIGID-AS-POSSIBLE SHAPE MANIPULATION
Image Deformation Using Moving Least Squares Scott Schaefer, Travis McPhail, Joe Warren SIGGRAPH 2006 Presented by Nirup Reddy.
1 Wavelets on Surfaces By Samson Timoner May 8, 2002 (picture from “Wavelets on Irregular Point Sets”) In partial fulfillment of the “Area Exam” doctoral.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
David Levin Tel-Aviv University Afrigraph 2009 Shape Preserving Deformation David Levin Tel-Aviv University Afrigraph 2009 Based on joint works with Yaron.
Hierarchical Deformation of Locally Rigid Meshes Josiah Manson and Scott Schaefer Texas A&M University.
Skuller: A volumetric shape registration algorithm for modeling skull deformities Yusuf Sahillioğlu 1 and Ladislav Kavan 2 Medical Image Analysis 2015.
using Radial Basis Function Interpolation
Distinctive Image Features from Scale-Invariant Keypoints
Construction of Navau and Garcia. Basic steps Construction has two parameters: smoothness k and n > k, defining how closely the surface follows the control.
Determining 3D Structure and Motion of Man-made Objects from Corners.
Motivation 2 groups of tools for free-from design Images credits go out to the FiberMesh SIGGRAPH presentation and other sources courtesy of Google.
Differential Coordinates and Laplacians Nicholas Vining Technical Director, Gaslamp Games.
MAN-522 Computer Vision Spring
Morphing and Shape Processing
You can check broken videos in this slide here :
CSE 554 Lecture 9: Laplacian Deformation
Structure from motion Input: Output: (Tomasi and Kanade)
Projective Transformations for Image Transition Animations
Y. Lipman D. Levin D. Cohen-Or
CSE 554 Lecture 10: Extrinsic Deformations
Y. Lipman D. Levin D. Cohen-Or
Structure from motion Input: Output: (Tomasi and Kanade)
Presentation transcript:

INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl Hans-Peter Seidel Max-Planck Institut für Informatik

INFORMATIK Our goal: Edit a surface while retaining its visual appearance

INFORMATIK Edit a surface while retaining its visual appearance Original surface The details are deformed The details shape is preserved

INFORMATIK Our goal Editing a surface while retaining its visual appearance –Smooth deformation –Smooth transition –Preserve relative local directions of the details –Minimal user interaction –Interactive time response T

INFORMATIK Differential coordinates Differential coordinates are defined for triangular mesh vertices average of the neighbors the relative coordinate vector

INFORMATIK Differential coordinates Differential coordinates are defined for triangular mesh vertices

INFORMATIK Why differential coordinates? They represent the local detail / local shape description –The direction approximates the normal –The size approximates the mean curvature

INFORMATIK Related work Multi-resolution: Zorin el al.[97], Kobbelt et al.[98], Guskov et al.[99] Laplacians smoothing Taubin [SIGGRAPH95], Laplacians Morphing Alexa [TVC03] Image editing: Perez et al. [SIGGRAPH03] Mesh Editing: Zhou et al. [SIGGRAPH 04]

INFORMATIK Laplacian reconstruction Denote by a triangular mesh with geometry, embedded in R³. For each vertex we define the Laplacian vector: The Laplacians represents the details locally.

INFORMATIK Laplacian reconstruction The operator is linear and thus can be represented by the following matrix:

INFORMATIK Laplacian reconstruction Transforming the mesh to the differential representation: Note that where

INFORMATIK Laplacian reconstruction Thus for reconstructing the mesh from the Laplacian representation: add constraints to get full rank system and therefore unique solution, i.e. unique minimizer to the functional where is the index set of constrained vertices, are weights and are the spatial constraints.

INFORMATIK Laplacian reconstruction The use of Laplacian (differential) representation and least squares solution forces local detail preserving

INFORMATIK Laplacian reconstruction Laplacian reconstruction gives smooth transformation, interactive time and ease of user interface -using few spatial constraints but doesn’t preserve details orientation and shape

INFORMATIK Rotated Laplacian reconstruction We’d like to perform deformation which preserves the detail orientation and shape: We’d like to estimate the target shape Laplacians

INFORMATIK Rotated Laplacian reconstruction For each 1-ring we look for rigid affine transformations :

INFORMATIK Rotated Laplacian reconstruction The Laplacians are translation invariant:

INFORMATIK Rotated Laplacian reconstruction Laplacians are not rotational invariant (they represent detail with orientation) Note that the Laplacian operator commute with linear rotations : R

INFORMATIK Rotated Laplacian reconstruction Therefore we get: So all we need is to estimate the local rotations.

INFORMATIK Rotated Laplacian reconstruction From our assumption that detail remain with same orientation to the underlying smooth surface: The rotations are defined by the smoothed surface. We use the Laplacian reconstruction to evaluate the smoothed underlying surface normals.

INFORMATIK Rotated Laplacian reconstruction In summary we have the following steps: 1. Reconstruct the surface with original Laplacians: 2. Approximate local rotations 3. Rotate each Laplacian coordinate by 4. Reconstruct the edited surface:

INFORMATIK Some results

INFORMATIK Some results

INFORMATIK Some results

INFORMATIK Implementation We solve the normal equations via factorization. The factorization is done once for each ROI. And back substitution for each new handle location.

INFORMATIK Future work (October 2003) The main problem of the Laplacian coordinates are the need to estimate the rotation explicitly (also in Zhou et al. SIGGRAPH 2004). Instead those rotations can be computed implicitly so that the final shape is defined in one step! To be presented in SGP 2004 in Nice next month…

INFORMATIK Differential Coordinates for Interactive Mesh Editing