Easy modeling generate new shapes by deforming existing ones

Size: px
Start display at page:

Download "Easy modeling generate new shapes by deforming existing ones"

Transcription

1 Deformation I

2 Deformation

3 Motivation Easy modeling generate new shapes by deforming existing ones

4 Motivation Easy modeling generate new shapes by deforming existing ones

5 Motivation Character posing for animation

6 Challenges User says as little l as possible algorithm deduces dd the rest

7 Challenges Intuitive deformation global change + local detail preservation

8 Challenges Intuitive deformation global change + local detail preservation

9 Efficient! Challenges

10 Rules of the Game Shape Deformation Algorithm Deformed Shape Constraints Position: This point goes there Orientation/Scale: The environment of this point should rotate/scale Other shape property: Curvature, perimeter, [ Parameterization is also deformation : constraints = curvature 0 everywhere ]

11 Approaches Surface deformation Shape is empty pyshell Curve for 2D deformation Surface for 3D deformation Df Deformation only dfi defined don shape Deformation coupled with shape representation

12 Approaches Space deformation Shape is volumetric Planar domain in 2D Polyhedral domain in3d Deformation defined in neighborhood of shape Can be applied to any shape representation

13 Approaches Surface deformation Find alternative representation which is deformation invariant Space deformation Find a space map which has nice properties

14 Surface Deformation Setup: Choose alternative representation f(s) ) Given S find S such that Constraints(S ) are true f(s ) = f(s) (or close) An optimization problem S R R1 R2 R3

15 Shape Representation How good is the representation? Representation should always be invariant to: Global translation Global rotation Global scale? Depends on application Shapes we want reachable should have similar representations Almost isometric deformation local translation + rotation Almost conformal deformation local translation + rotation + scale

16 Shape Representation Robustness How hard is it to solve the optimization problem? Can we find the global minimum? Small change in constraints similar shape? Efficiency Canit be solvedat interactiverates? rates?

17 Shape Representations Rule of thumb: If representation is a linear function of the coordinates, deformation is: Robust Fast But representation tti is not rotation tti invariant! i (for large rotations)

18 Surface Representations Laplacian coordinates Edge lengths + dihedral angles Pyramid coordinates Local frames.

19 Laplacian Coordinates [Sorkine et al. 04] Control mechanism Handles (vertices) moved by user Region of influence (ROI) Movie

20 Laplacian Coordinates δ = LV = (I-D -1 A)V I = Identity matrix D = Diagonal matrix [d ii = deg(v i )] A = Adjacency matrix V = Vertices in mesh Approximation to normals unique up to translation Reconstruct by solving LV = δ for V, with one constraint Poisson equation

21 Deformation Pose modeling constraints for vertices C V v i = u i i C No exact solution, minimize i i error Laplacian Laplacian User Constraints coordinates of coordinates of original mesh deformed mesh

22 Deformation Laplacian Laplacian User Constraints coordinates of coordinates of original mesh deformed mesh

23 Linear Least Squares Ax = b with m equations, n unknowns Normal equations: (A T A)x = A T b Solution by pseudo inverse: x = A + b= [(A T A) -1 A T ]b If system under determined: x = arg min { x : Ax = b } If system over determined: x = arg min { Ax-b 2 }

24 Laplacian Coordinates Sanity Check Translation invariant? Rotation/scale invariant? δ i δ i δ i

25 Problem

26 input Laplacian coords Rotation invariant coords

27 Rotation Invariant Coords The representation should take into account local rotations + scale δ i = L(v i ) T i δ i = L(v i ) v i v' i δ i δ i T i δ i δ i

28 Rotation Invariant Coords The representation should take into account local rotations + scale δ i = L(v i ) T i δ i = L(v i ) Problem: T i depends on deformed position v i

29 Solution: Implicit Transformations Idea: solve for local transformation and deformed surface simultaneously Transformation of the local frame

30 Similarities Restrict T i to good transformations = rotation + scale similarity transformation Similarity Transformation

31 Similarities Conditions on T i to be a similarity matrix? Linear in 2D: Auxiliary variables ibl Uniform Rotation + scale translation

32 Similarities 2D

33 Similarities 3D case Not linear in 3D: Linearize by dropping the quadratic term Effectively: only small rotations are handled

34 Laplacian Coordinates Realtime? Need to solve a linear system each frame (A T A)x = A T b Precompute sparse Cholesky factorization Only back substitution per frame

35 Some Results

36 Some Results

37 Limitations: Large Rotations

38 How to Find the Rotations? Laplacian coordinates solve for them Problem: not linear Another approach: propagate rotations tti from handles

39 Rotation Propagation Compute handle s deformation gradient Extract rotation and scale/shear components Propagate damped rotations over ROI

40 Deformation Gradient Handle has been transformed affinely Deformation gradient is: Extract rotation R and scale/shear S

41 Smooth Propagation Construct smooth scalar field ld[ [0,1] α(x)=1 Full deformation (handle) α(x)=0 No deformation (fixed part) α(x) [0,1] ( ) [, ] Damp transformation (in between) Linearly damp scale/shear: S(x)= α(x)s(handle) L l d tti Log scale damp rotation: R(x) = exp(α(x)log(r(handle))

42 Limitations Works well for rotations Translations don t change deformation gradient Translation insensitivity

43 The Curse of Rotations Can t solve for them directly using a linear system Can t propagate if the handles don t rotate Some linear methods work for rotations Some work for translations None work for both

44 The Curse of Rotations Non linear methods work for both large rotations and translation only No free lunch: much more expensive

Def De orma f tion orma Disney/Pixar

Def De orma f tion orma Disney/Pixar Deformation Disney/Pixar Deformation 2 Motivation Easy modeling generate new shapes by deforming existing ones 3 Motivation Easy modeling generate new shapes by deforming existing ones 4 Motivation Character

More information

Computational Design. Stelian Coros

Computational Design. Stelian Coros Computational Design Stelian Coros Schedule for presentations February 3 5 10 12 17 19 24 26 March 3 5 10 12 17 19 24 26 30 April 2 7 9 14 16 21 23 28 30 Send me: ASAP: 3 choices for dates + approximate

More information

Real-Time Shape Editing using Radial Basis Functions

Real-Time Shape Editing using Radial Basis Functions Real-Time Shape Editing using Radial Basis Functions, Leif Kobbelt RWTH Aachen Boundary Constraint Modeling Prescribe irregular constraints Vertex positions Constrained energy minimization Optimal fairness

More information

Deformation II. Disney/Pixar

Deformation II. Disney/Pixar Deformation II Disney/Pixar 1 Space Deformation Deformation function on ambient space f : n n Shape S deformed by applying f to points of S S = f (S) f (x,y)=(2x,y) S S 2 Motivation Can be applied to any

More information

Laplacian Meshes. COS 526 Fall 2016 Slides from Olga Sorkine and Yaron Lipman

Laplacian Meshes. COS 526 Fall 2016 Slides from Olga Sorkine and Yaron Lipman Laplacian Meshes COS 526 Fall 2016 Slides from Olga Sorkine and Yaron Lipman Outline Differential surface representation Ideas and applications Compact shape representation Mesh editing and manipulation

More information

Assignment 4: Mesh Parametrization

Assignment 4: Mesh Parametrization CSCI-GA.3033-018 - Geometric Modeling Assignment 4: Mesh Parametrization In this exercise you will Familiarize yourself with vector field design on surfaces. Create scalar fields whose gradients align

More information

(Sparse) Linear Solvers

(Sparse) Linear Solvers (Sparse) Linear Solvers Ax = B Why? Many geometry processing applications boil down to: solve one or more linear systems Parameterization Editing Reconstruction Fairing Morphing 2 Don t you just invert

More information

Geometric Modeling and Processing

Geometric Modeling and Processing Geometric Modeling and Processing Tutorial of 3DIM&PVT 2011 (Hangzhou, China) May 16, 2011 6. Mesh Simplification Problems High resolution meshes becoming increasingly available 3D active scanners Computer

More information

(Sparse) Linear Solvers

(Sparse) Linear Solvers (Sparse) Linear Solvers Ax = B Why? Many geometry processing applications boil down to: solve one or more linear systems Parameterization Editing Reconstruction Fairing Morphing 1 Don t you just invert

More information

Large Mesh Deformation Using the Volumetric Graph Laplacian

Large Mesh Deformation Using the Volumetric Graph Laplacian Large Mesh Deformation Using the Volumetric Graph Laplacian Kun Zhou1 Jin Huang2 John Snyder3 Xinguo Liu1 Hujun Bao2 Baining Guo1 Heung-Yeung Shum1 1 Microsoft Research Asia 2 Zhejiang University 3 Microsoft

More information

Shape Modeling and Geometry Processing

Shape Modeling and Geometry Processing 252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry

More information

Parameterization of Meshes

Parameterization of Meshes 2-Manifold Parameterization of Meshes What makes for a smooth manifold? locally looks like Euclidian space collection of charts mutually compatible on their overlaps form an atlas Parameterizations are

More information

Skeleton Based As-Rigid-As-Possible Volume Modeling

Skeleton Based As-Rigid-As-Possible Volume Modeling Skeleton Based As-Rigid-As-Possible Volume Modeling Computer Science Department, Rutgers University As-rigid-as-possible (ARAP) shape modeling is a popular technique to obtain natural deformations. There

More information

Geometric modeling 1

Geometric modeling 1 Geometric Modeling 1 Look around the room. To make a 3D model of a room requires modeling every single object you can see. Leaving out smaller objects (clutter) makes the room seem sterile and unrealistic

More information

Mesh-Based Inverse Kinematics

Mesh-Based Inverse Kinematics CS468, Wed Nov 9 th 2005 Mesh-Based Inverse Kinematics R. W. Sumner, M. Zwicker, C. Gotsman, J. Popović SIGGRAPH 2005 The problem 1 General approach Learn from experience... 2 As-rigid-as-possible shape

More information

Correspondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov

Correspondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov Shape Matching & Correspondence CS 468 Geometry Processing Algorithms Maks Ovsjanikov Wednesday, October 27 th 2010 Overall Goal Given two shapes, find correspondences between them. Overall Goal Given

More information

TNM079 Modeling & Animation Lecture 6 (Implicit surfaces)

TNM079 Modeling & Animation Lecture 6 (Implicit surfaces) TNM079 Modeling & Animation Lecture 6 (Implicit surfaces) Mark Eric Dieckmann, Media and Information Technology, ITN Linköpings universitet Campus Norrköping SE-60174 Norrköping May 4, 2016 Content of

More information

Animation. Keyframe animation. CS4620/5620: Lecture 30. Rigid motion: the simplest deformation. Controlling shape for animation

Animation. Keyframe animation. CS4620/5620: Lecture 30. Rigid motion: the simplest deformation. Controlling shape for animation Keyframe animation CS4620/5620: Lecture 30 Animation Keyframing is the technique used for pose-to-pose animation User creates key poses just enough to indicate what the motion is supposed to be Interpolate

More information

Advanced Computer Graphics

Advanced Computer Graphics G22.2274 001, Fall 2010 Advanced Computer Graphics Project details and tools 1 Projects Details of each project are on the website under Projects Please review all the projects and come see me if you would

More information

Advanced Computer Graphics

Advanced Computer Graphics G22.2274 001, Fall 2009 Advanced Computer Graphics Project details and tools 1 Project Topics Computer Animation Geometric Modeling Computational Photography Image processing 2 Optimization All projects

More information

Digital Geometry Processing Parameterization I

Digital Geometry Processing Parameterization I Problem Definition Given a surface (mesh) S in R 3 and a domain find a bective F: S Typical Domains Cutting to a Disk disk = genus zero + boundary sphere = closed genus zero Creates artificial boundary

More information

1.7.1 Laplacian Smoothing

1.7.1 Laplacian Smoothing 1.7.1 Laplacian Smoothing 320491: Advanced Graphics - Chapter 1 434 Theory Minimize energy functional total curvature estimate by polynomial-fitting non-linear (very slow!) 320491: Advanced Graphics -

More information

PERFORMANCE CAPTURE FROM SPARSE MULTI-VIEW VIDEO

PERFORMANCE CAPTURE FROM SPARSE MULTI-VIEW VIDEO Stefan Krauß, Juliane Hüttl SE, SoSe 2011, HU-Berlin PERFORMANCE CAPTURE FROM SPARSE MULTI-VIEW VIDEO 1 Uses of Motion/Performance Capture movies games, virtual environments biomechanics, sports science,

More information

Geometric Modeling in Graphics

Geometric Modeling in Graphics Geometric Modeling in Graphics Part 10: Surface reconstruction Martin Samuelčík www.sccg.sk/~samuelcik samuelcik@sccg.sk Curve, surface reconstruction Finding compact connected orientable 2-manifold surface

More information

Surface Parameterization

Surface Parameterization Surface Parameterization A Tutorial and Survey Michael Floater and Kai Hormann Presented by Afra Zomorodian CS 468 10/19/5 1 Problem 1-1 mapping from domain to surface Original application: Texture mapping

More information

CSE452 Computer Graphics

CSE452 Computer Graphics CSE452 Computer Graphics Lecture 19: From Morphing To Animation Capturing and Animating Skin Deformation in Human Motion, Park and Hodgins, SIGGRAPH 2006 CSE452 Lecture 19: From Morphing to Animation 1

More information

Scanning Real World Objects without Worries 3D Reconstruction

Scanning Real World Objects without Worries 3D Reconstruction Scanning Real World Objects without Worries 3D Reconstruction 1. Overview Feng Li 308262 Kuan Tian 308263 This document is written for the 3D reconstruction part in the course Scanning real world objects

More information

10 - ARAP and Linear Blend Skinning

10 - ARAP and Linear Blend Skinning 10 - ARAP and Linear Blend Skinning Acknowledgements: Olga Sorkine-Hornung As Rigid As Possible Demo Libigl demo 405 As-Rigid-As-Possible Deformation Preserve shape of cells covering the surface Ask each

More information

Lecture 2 Unstructured Mesh Generation

Lecture 2 Unstructured Mesh Generation Lecture 2 Unstructured Mesh Generation MIT 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations Per-Olof Persson (persson@mit.edu) February 13, 2006 1 Mesh Generation Given a

More information

Animation. CS 4620 Lecture 32. Cornell CS4620 Fall Kavita Bala

Animation. CS 4620 Lecture 32. Cornell CS4620 Fall Kavita Bala Animation CS 4620 Lecture 32 Cornell CS4620 Fall 2015 1 What is animation? Modeling = specifying shape using all the tools we ve seen: hierarchies, meshes, curved surfaces Animation = specifying shape

More information

Skeletal deformation

Skeletal deformation CS 523: Computer Graphics, Spring 2009 Shape Modeling Skeletal deformation 4/22/2009 1 Believable character animation Computers games and movies Skeleton: intuitive, low dimensional subspace Clip courtesy

More information

Yaron Lipman Thomas Funkhouser. RifR Raif Rustamov. Princeton University. Drew University

Yaron Lipman Thomas Funkhouser. RifR Raif Rustamov. Princeton University. Drew University Barycentric Coordinates on Surfaces Yaron Lipman Thomas Funkhouser RifR Raif Rustamov Princeton University Drew University Motivation Barycentric coordinates good for: interpolation shading deformation

More information

How Much Geometry Lies in The Laplacian?

How Much Geometry Lies in The Laplacian? How Much Geometry Lies in The Laplacian? Encoding and recovering the discrete metric on triangle meshes Distance Geometry Workshop in Bad Honnef, November 23, 2017 Maks Ovsjanikov Joint with: E. Corman,

More information

Assignment 5: Shape Deformation

Assignment 5: Shape Deformation CSCI-GA.3033-018 - Geometric Modeling Assignment 5: Shape Deformation Goal of this exercise In this exercise, you will implement an algorithm to interactively deform 3D models. You will construct a two-level

More information

CS 523: Computer Graphics, Spring Shape Modeling. Skeletal deformation. Andrew Nealen, Rutgers, /12/2011 1

CS 523: Computer Graphics, Spring Shape Modeling. Skeletal deformation. Andrew Nealen, Rutgers, /12/2011 1 CS 523: Computer Graphics, Spring 2011 Shape Modeling Skeletal deformation 4/12/2011 1 Believable character animation Computers games and movies Skeleton: intuitive, low-dimensional subspace Clip courtesy

More information

04 - Normal Estimation, Curves

04 - Normal Estimation, Curves 04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0

More information

Matrix Inverse 2 ( 2) 1 = 2 1 2

Matrix Inverse 2 ( 2) 1 = 2 1 2 Name: Matrix Inverse For Scalars, we have what is called a multiplicative identity. This means that if we have a scalar number, call it r, then r multiplied by the multiplicative identity equals r. Without

More information

SCAPE: Shape Completion and Animation of People

SCAPE: Shape Completion and Animation of People SCAPE: Shape Completion and Animation of People By Dragomir Anguelov, Praveen Srinivasan, Daphne Koller, Sebastian Thrun, Jim Rodgers, James Davis From SIGGRAPH 2005 Presentation for CS468 by Emilio Antúnez

More information

2D Shape Deformation Using Nonlinear Least Squares Optimization

2D Shape Deformation Using Nonlinear Least Squares Optimization 2D Shape Deformation Using Nonlinear Least Squares Optimization Paper ID: 20 Abstract This paper presents a novel 2D shape deformation algorithm based on nonlinear least squares optimization. The algorithm

More information

Geometric Modeling Assignment 3: Discrete Differential Quantities

Geometric Modeling Assignment 3: Discrete Differential Quantities Geometric Modeling Assignment : Discrete Differential Quantities Acknowledgements: Julian Panetta, Olga Diamanti Assignment (Optional) Topic: Discrete Differential Quantities with libigl Vertex Normals,

More information

Humanoid Robotics. Least Squares. Maren Bennewitz

Humanoid Robotics. Least Squares. Maren Bennewitz Humanoid Robotics Least Squares Maren Bennewitz Goal of This Lecture Introduction into least squares Use it yourself for odometry calibration, later in the lecture: camera and whole-body self-calibration

More information

Distance Functions 1

Distance Functions 1 Distance Functions 1 Distance function Given: geometric object F (curve, surface, solid, ) Assigns to each point the shortest distance from F Level sets of the distance function are trimmed offsets F p

More information

Accurate Reconstruction by Interpolation

Accurate Reconstruction by Interpolation Accurate Reconstruction by Interpolation Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore International Conference on Inverse Problems and Related Topics

More information

Computing and Processing Correspondences with Functional Maps

Computing and Processing Correspondences with Functional Maps Computing and Processing Correspondences with Functional Maps SIGGRAPH 2017 course Maks Ovsjanikov, Etienne Corman, Michael Bronstein, Emanuele Rodolà, Mirela Ben-Chen, Leonidas Guibas, Frederic Chazal,

More information

3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013

3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013 3D Modeling Parametric Curves & Surfaces Shandong University Spring 2013 3D Object Representations Raw data Point cloud Range image Polygon soup Surfaces Mesh Subdivision Parametric Implicit Solids Voxels

More information

CS 523: Computer Graphics, Spring Differential Geometry of Surfaces

CS 523: Computer Graphics, Spring Differential Geometry of Surfaces CS 523: Computer Graphics, Spring 2009 Shape Modeling Differential Geometry of Surfaces Andrew Nealen, Rutgers, 2009 3/4/2009 Recap Differential Geometry of Curves Andrew Nealen, Rutgers, 2009 3/4/2009

More information

Geodesics in heat: A new approach to computing distance

Geodesics in heat: A new approach to computing distance Geodesics in heat: A new approach to computing distance based on heat flow Diana Papyan Faculty of Informatics - Technische Universität München Abstract In this report we are going to introduce new method

More information

Simulation in Computer Graphics. Deformable Objects. Matthias Teschner. Computer Science Department University of Freiburg

Simulation in Computer Graphics. Deformable Objects. Matthias Teschner. Computer Science Department University of Freiburg Simulation in Computer Graphics Deformable Objects Matthias Teschner Computer Science Department University of Freiburg Outline introduction forces performance collision handling visualization University

More information

For each question, indicate whether the statement is true or false by circling T or F, respectively.

For each question, indicate whether the statement is true or false by circling T or F, respectively. True/False For each question, indicate whether the statement is true or false by circling T or F, respectively. 1. (T/F) Rasterization occurs before vertex transformation in the graphics pipeline. 2. (T/F)

More information

Skeleton-Based Shape Deformation using Simplex Transformations

Skeleton-Based Shape Deformation using Simplex Transformations Computer Graphics International 2006 Skeleton-Based Shape Deformation using Simplex Transformations Han-Bing Yan, Shi-Min Hu and Ralph Martin Outline Motivation Introduction Mesh segmentation using skeleton

More information

Visualizing Quaternions

Visualizing Quaternions Visualizing Quaternions Andrew J. Hanson Computer Science Department Indiana University Siggraph 1 Tutorial 1 GRAND PLAN I: Fundamentals of Quaternions II: Visualizing Quaternion Geometry III: Quaternion

More information

Deformation Transfer for Detail-Preserving Surface Editing

Deformation Transfer for Detail-Preserving Surface Editing Deformation Transfer for Detail-Preserving Surface Editing Mario Botsch Robert W Sumner 2 Mark Pauly 2 Markus Gross Computer Graphics Laboratory, ETH Zurich 2 Applied Geometry Group, ETH Zurich Abstract

More information

Geometric Registration for Deformable Shapes 3.3 Advanced Global Matching

Geometric Registration for Deformable Shapes 3.3 Advanced Global Matching Geometric Registration for Deformable Shapes 3.3 Advanced Global Matching Correlated Correspondences [ASP*04] A Complete Registration System [HAW*08] In this session Advanced Global Matching Some practical

More information

Animation. CS 465 Lecture 22

Animation. CS 465 Lecture 22 Animation CS 465 Lecture 22 Animation Industry production process leading up to animation What animation is How animation works (very generally) Artistic process of animation Further topics in how it works

More information

Matching. Compare region of image to region of image. Today, simplest kind of matching. Intensities similar.

Matching. Compare region of image to region of image. Today, simplest kind of matching. Intensities similar. Matching Compare region of image to region of image. We talked about this for stereo. Important for motion. Epipolar constraint unknown. But motion small. Recognition Find object in image. Recognize object.

More information

THIS paper presents the recent advances in mesh deformation

THIS paper presents the recent advances in mesh deformation 1 On Linear Variational Surface Deformation Methods Mario Botsch Computer Graphics Laboratory ETH Zurich Olga Sorkine Computer Graphics Group TU Berlin Abstract This survey reviews the recent advances

More information

3D Modeling techniques

3D Modeling techniques 3D Modeling techniques 0. Reconstruction From real data (not covered) 1. Procedural modeling Automatic modeling of a self-similar objects or scenes 2. Interactive modeling Provide tools to computer artists

More information

Parallel Computation of Spherical Parameterizations for Mesh Analysis. Th. Athanasiadis and I. Fudos University of Ioannina, Greece

Parallel Computation of Spherical Parameterizations for Mesh Analysis. Th. Athanasiadis and I. Fudos University of Ioannina, Greece Parallel Computation of Spherical Parameterizations for Mesh Analysis Th. Athanasiadis and I. Fudos, Greece Introduction Mesh parameterization is a powerful geometry processing tool Applications Remeshing

More information

Scientific Visualization Example exam questions with commented answers

Scientific Visualization Example exam questions with commented answers Scientific Visualization Example exam questions with commented answers The theoretical part of this course is evaluated by means of a multiple- choice exam. The questions cover the material mentioned during

More information

Introduction to Computer Graphics

Introduction to Computer Graphics Introduction to Computer Graphics 2016 Spring National Cheng Kung University Instructors: Min-Chun Hu 胡敏君 Shih-Chin Weng 翁士欽 ( 西基電腦動畫 ) Data Representation Curves and Surfaces Limitations of Polygons Inherently

More information

Stereo Matching for Calibrated Cameras without Correspondence

Stereo Matching for Calibrated Cameras without Correspondence Stereo Matching for Calibrated Cameras without Correspondence U. Helmke, K. Hüper, and L. Vences Department of Mathematics, University of Würzburg, 97074 Würzburg, Germany helmke@mathematik.uni-wuerzburg.de

More information

Effective Derivation of Similarity Transformations for Implicit Laplacian Mesh Editing

Effective Derivation of Similarity Transformations for Implicit Laplacian Mesh Editing Volume xx (200y), Number z, pp. 1 12 Effective Derivation of Similarity Transformations for Implicit Laplacian Mesh Editing Hongbo Fu Oscar Kin-Chung Au Chiew-Lan Tai Department of Computer Science and

More information

3D shape from the structure of pencils of planes and geometric constraints

3D shape from the structure of pencils of planes and geometric constraints 3D shape from the structure of pencils of planes and geometric constraints Paper ID: 691 Abstract. Active stereo systems using structured light has been used as practical solutions for 3D measurements.

More information

Möbius Transformations in Scientific Computing. David Eppstein

Möbius Transformations in Scientific Computing. David Eppstein Möbius Transformations in Scientific Computing David Eppstein Univ. of California, Irvine School of Information and Computer Science (including joint work with Marshall Bern from WADS 01 and SODA 03) Outline

More information

Surfaces, meshes, and topology

Surfaces, meshes, and topology Surfaces from Point Samples Surfaces, meshes, and topology A surface is a 2-manifold embedded in 3- dimensional Euclidean space Such surfaces are often approximated by triangle meshes 2 1 Triangle mesh

More information

Midterm Examination CS 534: Computational Photography

Midterm Examination CS 534: Computational Photography Midterm Examination CS 534: Computational Photography November 3, 2016 NAME: Problem Score Max Score 1 6 2 8 3 9 4 12 5 4 6 13 7 7 8 6 9 9 10 6 11 14 12 6 Total 100 1 of 8 1. [6] (a) [3] What camera setting(s)

More information

Sung-Eui Yoon ( 윤성의 )

Sung-Eui Yoon ( 윤성의 ) CS480: Computer Graphics Curves and Surfaces Sung-Eui Yoon ( 윤성의 ) Course URL: http://jupiter.kaist.ac.kr/~sungeui/cg Today s Topics Surface representations Smooth curves Subdivision 2 Smooth Curves and

More information

Geometric Modeling Assignment 5: Shape Deformation

Geometric Modeling Assignment 5: Shape Deformation Geometric Modeling Assignment 5: Shape Deformation Acknowledgements: Olga Diamanti, Julian Panetta Shape Deformation Step 1: Select and Deform Handle Regions Draw vertex selection with mouse H 2 Move one

More information

Question 2: Linear algebra and transformations matrices rotation vectors linear transformation T=U*D*VT

Question 2: Linear algebra and transformations matrices rotation vectors linear transformation T=U*D*VT You must answer all questions. For full credit, an answer must be both correct and well-presented (clear and concise). If you feel a question is ambiguous, state any assumptions that you need to make.

More information

2D Image Transforms Computer Vision (Kris Kitani) Carnegie Mellon University

2D Image Transforms Computer Vision (Kris Kitani) Carnegie Mellon University 2D Image Transforms 16-385 Computer Vision (Kris Kitani) Carnegie Mellon University Extract features from an image what do we do next? Feature matching (object recognition, 3D reconstruction, augmented

More information

Cross-Parameterization and Compatible Remeshing of 3D Models

Cross-Parameterization and Compatible Remeshing of 3D Models Cross-Parameterization and Compatible Remeshing of 3D Models Vladislav Kraevoy Alla Sheffer University of British Columbia Authors Vladislav Kraevoy Ph.D. Student Alla Sheffer Assistant Professor Outline

More information

Mesh Processing Pipeline

Mesh Processing Pipeline Mesh Smoothing 1 Mesh Processing Pipeline... Scan Reconstruct Clean Remesh 2 Mesh Quality Visual inspection of sensitive attributes Specular shading Flat Shading Gouraud Shading Phong Shading 3 Mesh Quality

More information

Mesh Morphing. Ligang Liu Graphics&Geometric Computing Lab USTC

Mesh Morphing. Ligang Liu Graphics&Geometric Computing Lab USTC Mesh Morphing Ligang Liu Graphics&Geometric Computing Lab USTC http://staff.ustc.edu.cn/~lgliu Morphing Given two objects produce sequence of intermediate objects that gradually evolve from one object

More information

The SIFT (Scale Invariant Feature

The SIFT (Scale Invariant Feature The SIFT (Scale Invariant Feature Transform) Detector and Descriptor developed by David Lowe University of British Columbia Initial paper ICCV 1999 Newer journal paper IJCV 2004 Review: Matt Brown s Canonical

More information

Practical Least-Squares for Computer Graphics

Practical Least-Squares for Computer Graphics Outline Least Squares with Generalized Errors Robust Least Squares Constrained Least Squares Practical Least-Squares for Computer Graphics Outline Least Squares with Generalized Errors Robust Least Squares

More information

1 (5 max) 2 (10 max) 3 (20 max) 4 (30 max) 5 (10 max) 6 (15 extra max) total (75 max + 15 extra)

1 (5 max) 2 (10 max) 3 (20 max) 4 (30 max) 5 (10 max) 6 (15 extra max) total (75 max + 15 extra) Mierm Exam CS223b Stanford CS223b Computer Vision, Winter 2004 Feb. 18, 2004 Full Name: Email: This exam has 7 pages. Make sure your exam is not missing any sheets, and write your name on every page. The

More information

Building a Panorama. Matching features. Matching with Features. How do we build a panorama? Computational Photography, 6.882

Building a Panorama. Matching features. Matching with Features. How do we build a panorama? Computational Photography, 6.882 Matching features Building a Panorama Computational Photography, 6.88 Prof. Bill Freeman April 11, 006 Image and shape descriptors: Harris corner detectors and SIFT features. Suggested readings: Mikolajczyk

More information

CoE4TN4 Image Processing

CoE4TN4 Image Processing CoE4TN4 Image Processing Chapter 11 Image Representation & Description Image Representation & Description After an image is segmented into regions, the regions are represented and described in a form suitable

More information

Special Topics in Visualization

Special Topics in Visualization Special Topics in Visualization Final Project Report Dual contouring of Hermite Data Submitted By S M Shahed Nejhum 8589-1199 May 19, 2008 Introduction Iso-surface extraction from 3D volumetric data is

More information

Animations. Hakan Bilen University of Edinburgh. Computer Graphics Fall Some slides are courtesy of Steve Marschner and Kavita Bala

Animations. Hakan Bilen University of Edinburgh. Computer Graphics Fall Some slides are courtesy of Steve Marschner and Kavita Bala Animations Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 Some slides are courtesy of Steve Marschner and Kavita Bala Animation Artistic process What are animators trying to do? What tools

More information

3D Modeling Parametric Curves & Surfaces

3D Modeling Parametric Curves & Surfaces 3D Modeling Parametric Curves & Surfaces Shandong University Spring 2012 3D Object Representations Raw data Point cloud Range image Polygon soup Solids Voxels BSP tree CSG Sweep Surfaces Mesh Subdivision

More information

Models and The Viewing Pipeline. Jian Huang CS456

Models and The Viewing Pipeline. Jian Huang CS456 Models and The Viewing Pipeline Jian Huang CS456 Vertex coordinates list, polygon table and (maybe) edge table Auxiliary: Per vertex normal Neighborhood information, arranged with regard to vertices and

More information

Laplacian Operator and Smoothing

Laplacian Operator and Smoothing Laplacian Operator and Smoothing Xifeng Gao Acknowledgements for the slides: Olga Sorkine-Hornung, Mario Botsch, and Daniele Panozzo Applications in Geometry Processing Smoothing Parameterization Remeshing

More information

Geometry Processing & Geometric Queries. Computer Graphics CMU /15-662

Geometry Processing & Geometric Queries. Computer Graphics CMU /15-662 Geometry Processing & Geometric Queries Computer Graphics CMU 15-462/15-662 Last time: Meshes & Manifolds Mathematical description of geometry - simplifying assumption: manifold - for polygon meshes: fans,

More information

Numerical methods for volume preserving image registration

Numerical methods for volume preserving image registration Numerical methods for volume preserving image registration SIAM meeting on imaging science 2004 Eldad Haber with J. Modersitzki haber@mathcs.emory.edu Emory University Volume preserving IR p.1/?? Outline

More information

First of all, we need to know what it means for a parameterize curve to be differentiable. FACT:

First of all, we need to know what it means for a parameterize curve to be differentiable. FACT: CALCULUS WITH PARAMETERIZED CURVES In calculus I we learned how to differentiate and integrate functions. In the chapter covering the applications of the integral, we learned how to find the length of

More information

GENERALIZING THE HOUGH TRANSFORM TO DETECT ARBITRARY SHAPES. D. H. Ballard Pattern Recognition Vol. 13 No

GENERALIZING THE HOUGH TRANSFORM TO DETECT ARBITRARY SHAPES. D. H. Ballard Pattern Recognition Vol. 13 No GENERALIZING THE HOUGH TRANSFORM TO DETECT ARBITRARY SHAPES D. H. Ballard Pattern Recognition Vol. 13 No. 2 1981 What is the generalized Hough (Huff) transform used for? Hough transform is a way of encoding

More information

Shape Modeling. Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell. CS 523: Computer Graphics, Spring 2011

Shape Modeling. Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell. CS 523: Computer Graphics, Spring 2011 CS 523: Computer Graphics, Spring 2011 Shape Modeling Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell 2/15/2011 1 Motivation Geometry processing: understand geometric characteristics,

More information

CSE 554 Lecture 6: Fairing and Simplification

CSE 554 Lecture 6: Fairing and Simplification CSE 554 Lecture 6: Fairing and Simplification Fall 2012 CSE554 Fairing and simplification Slide 1 Review Iso-contours in grayscale images and volumes Piece-wise linear representations Polylines (2D) and

More information

3D Mathematics. Co-ordinate systems, 3D primitives and affine transformations

3D Mathematics. Co-ordinate systems, 3D primitives and affine transformations 3D Mathematics Co-ordinate systems, 3D primitives and affine transformations Coordinate Systems 2 3 Primitive Types and Topologies Primitives Primitive Types and Topologies 4 A primitive is the most basic

More information

Noise Model. Important Noise Probability Density Functions (Cont.) Important Noise Probability Density Functions

Noise Model. Important Noise Probability Density Functions (Cont.) Important Noise Probability Density Functions Others -- Noise Removal Techniques -- Edge Detection Techniques -- Geometric Operations -- Color Image Processing -- Color Spaces Xiaojun Qi Noise Model The principal sources of noise in digital images

More information

Image Warping. Computational Photography Derek Hoiem, University of Illinois 09/28/17. Photo by Sean Carroll

Image Warping. Computational Photography Derek Hoiem, University of Illinois 09/28/17. Photo by Sean Carroll Image Warping 9/28/7 Man slides from Alosha Efros + Steve Seitz Computational Photograph Derek Hoiem, Universit of Illinois Photo b Sean Carroll Reminder: Proj 2 due monda Much more difficult than project

More information

Additional mathematical results

Additional mathematical results Additional mathematical results In this appendix we consider some useful mathematical results that are relevant to threedimensional computer graphics but were not considered in the book itself. 0.1 The

More information

Animation Curves and Splines 2

Animation Curves and Splines 2 Animation Curves and Splines 2 Animation Homework Set up Thursday a simple avatar E.g. cube/sphere (or square/circle if 2D) Specify some key frames (positions/orientations) Associate Animation a time with

More information

Intro to Curves Week 1, Lecture 2

Intro to Curves Week 1, Lecture 2 CS 536 Computer Graphics Intro to Curves Week 1, Lecture 2 David Breen, William Regli and Maxim Peysakhov Department of Computer Science Drexel University Outline Math review Introduction to 2D curves

More information

Surface Reconstruction. Gianpaolo Palma

Surface Reconstruction. Gianpaolo Palma Surface Reconstruction Gianpaolo Palma Surface reconstruction Input Point cloud With or without normals Examples: multi-view stereo, union of range scan vertices Range scans Each scan is a triangular mesh

More information

Curves and Surfaces. Computer Graphics COMP 770 (236) Spring Instructor: Brandon Lloyd

Curves and Surfaces. Computer Graphics COMP 770 (236) Spring Instructor: Brandon Lloyd Curves and Surfaces Computer Graphics COMP 770 (236) Spring 2007 Instructor: Brandon Lloyd 4/11/2007 Final projects Surface representations Smooth curves Subdivision Todays Topics 2 Final Project Requirements

More information

Surface Topology ReebGraph

Surface Topology ReebGraph Sub-Topics Compute bounding box Compute Euler Characteristic Estimate surface curvature Line description for conveying surface shape Extract skeletal representation of shapes Morse function and surface

More information

Efficient Iterative Semi-supervised Classification on Manifold

Efficient Iterative Semi-supervised Classification on Manifold . Efficient Iterative Semi-supervised Classification on Manifold... M. Farajtabar, H. R. Rabiee, A. Shaban, A. Soltani-Farani Sharif University of Technology, Tehran, Iran. Presented by Pooria Joulani

More information

Estimating affine-invariant structures on triangle meshes

Estimating affine-invariant structures on triangle meshes Estimating affine-invariant structures on triangle meshes Thales Vieira Mathematics, UFAL Dimas Martinez Mathematics, UFAM Maria Andrade Mathematics, UFS Thomas Lewiner École Polytechnique Invariant descriptors

More information