Harmonic Coordinates for Character Articulation PIXAR

Similar documents
Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

Hermite Splines in Lie Groups as Products of Geodesics

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

A Unified, Integral Construction For Coordinates Over Closed Curves

GSLM Operations Research II Fall 13/14

Radial Basis Functions

S1 Note. Basis functions.

Injective Shape Deformations Using Cube-Like Cages

Machine Learning 9. week

Lecture 5: Multilayer Perceptrons

Problem Set 3 Solutions

LECTURE : MANIFOLD LEARNING

Reading. 14. Subdivision curves. Recommended:

Some Tutorial about the Project. Computer Graphics

Computer Graphics. - Spline and Subdivision Surfaces - Hendrik Lensch. Computer Graphics WS07/08 Spline & Subdivision Surfaces

Dijkstra s Single Source Algorithm. All-Pairs Shortest Paths. Dynamic Programming Solution. Performance. Decision Sequence.

Support Vector Machines. CS534 - Machine Learning

Dijkstra s Single Source Algorithm. All-Pairs Shortest Paths. Dynamic Programming Solution. Performance

All-Pairs Shortest Paths. Approximate All-Pairs shortest paths Approximate distance oracles Spanners and Emulators. Uri Zwick Tel Aviv University

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Structure from Motion

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

i v v 6 i 2 i 3 v + (1) (2) (3) (4) (5) Substituting (4) and (5) into (3) (6) = 2 (7) (5) and (6) (8) (4) and (6) ˆ

Research Article Quasi-Bézier Curves with Shape Parameters

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Scan Conversion & Shading

Power Coordinates: A Geometric Construction of Barycentric Coordinates on Convex Polytopes

Scan Conversion & Shading

5 The Primal-Dual Method

Lecture #15 Lecture Notes

Line geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna.

Active Contours/Snakes

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Mode III fracture mechanics analysis with Fourier series method

arxiv: v2 [math.na] 26 Apr 2016

Classification / Regression Support Vector Machines

Loop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont)

Electrical analysis of light-weight, triangular weave reflector antennas

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces


R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimal Quadrilateral Finite Elements on Polygonal Domains

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Subdividing Barycentric Coordinates

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

3D vector computer graphics

Programming in Fortran 90 : 2017/2018

In the planar case, one possibility to create a high quality. curve that interpolates a given set of points is to use a clothoid spline,

Fitting: Deformable contours April 26 th, 2018

UNIT 2 : INEQUALITIES AND CONVEX SETS

Real-time. Shading of Folded Surfaces

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

Simplification of 3D Meshes

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

Support Vector Machines

11. APPROXIMATION ALGORITHMS

Modeling of the Absorption of the Electromagnetic Wave Energy in the Human Head Induced by Cell Phone

b * -Open Sets in Bispaces

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

Analysis of Continuous Beams in General

Parameterization of Quadrilateral Meshes

Non-Rigid Registration and Correspondence Finding in Medical Image Analysis Using Multiple-Layer Flexible Mesh Template Matching

Multi-stable Perception. Necker Cube

Loop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation

Math Homotopy Theory Additional notes

High-Boost Mesh Filtering for 3-D Shape Enhancement

Complex Filtering and Integration via Sampling

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

A Hierarchical Deformable Model Using Statistical and Geometric Information

Computational Geometry: Theory and Applications

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)

Smooth Approximation to Surface Meshes of Arbitrary Topology with Locally Blended Radial Basis Functions

(e.g., []). In such cases, both the grd generaton process and the soluton of the resultng lnear systems can be computatonally expensve. The lack of re

Deformable Surface Tracking Ambiguities

Polyhedral Compilation Foundations

Application of Learning Machine Methods to 3 D Object Modeling

Network Coding as a Dynamical System

Feature Reduction and Selection

The Codesign Challenge

Mesh Editing in ROI with Dual Laplacian

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

A Robust LS-SVM Regression

BASIC DIFFERENTIABLE MANIFOLDS AND APPLICATIONS MAPS WITH TRANSLATORS TANGENT AND COTANGENT SPACES

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

On the diameter of random planar graphs

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

Adaptive Fairing of Surface Meshes by Geometric Diffusion

Inverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016

ALEKSANDROV URYSOHN COMPACTNESS CRITERION ON INTUITIONISTIC FUZZY S * STRUCTURE SPACE

Transcription:

Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock

We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to the cage to be appled approprately to the source mesh

Mean Value Coordnates Ju, Schaefer, Warren, 2005 p = g( p) C g p ( p) C New object vertces Mean value coordnate Weghtng functons Deformed cage vertces

g To compute for each nteror pont p: ( p) Consder each pont x on the boundary Multply f ( x) by the recprocal dstance from x to p Average over all x From the Ju paper: g( p) x = wxv (, ) f( xds ) x wxvds (, ) p p where wxp (, ) = x 1 p and S p s the unt sphere centered at p

g To compute for each nteror pont p: ( p) Consder each pont x on the boundary Multply f ( x) by the recprocal dstance from x to p Average over all x Good thngs: Topologcal flexblty n desgnng the cage (any closed tr-mesh) Deformatons are smooth Functons are lnear, so no poppng p x Bad thngs: Does not respect the vsblty of x from p If a cage vertex has a negatve weght assocated wth t, then the object vertex and cage vertex wll move n opposte drectons

Mean Value Coordnate Feld Desred Coordnate Feld + -

Instead, let s average over all Brownan paths leavng p Ths wll consder the vsblty of x from p Essental for any concave mesh Interestngly enough Ths s the same as solvng Laplace s equaton Porf, Stone 1978 & Bass 1995 p x Δ h( p) = 0 p Interor( C) Solve for every cage vertex p Let us frst approach thngs n two dmensons

Boundary condtons: Let p denote a pont on the boundary C of C Then: h( p) = φ ( p), for all p C where φ ( p) s the pecewse lnear functon such that φ ( C ) = δ, j j

Propertes: Interpolaton ( ) = δ, h C j j Smoothness The functons h p are smooth n the nteror of the cage Non-negatvty ( ) 0 ( ) h p for all p C Interor localty Interor localty holds f we have the non-negatvty property and no nteror extrema Lnear reproducton Gven an arbtrary f(p), the coordnate functons can be used to defne: [ ]( ) ( ) ( ) H f p = h p f C Ths s the no poppng condton

Propertes: Affne nvarance h ( p ) = 1 for all p C Generalzaton of barycentrc coordnates ( ) h p s the barycentrc coordnate of p wth respect to C

Interpolaton: ( ) = φ ( C ) = δ, h C j j j Smoothness: Away from the boundary, harmonc coordnates are solutons, so they are smooth n the cage nteror On the boundary, they are only as smooth as the boundary condtons Non-negatvty: Harmonc functons acheve extreme at ther boundares Boundary values are restrcted to [0,1] So nteror values are restrcted to [0,1] Interor localty: Harmonc functons possess no nteror extrema

Lnear reproducton: Ths holds for everywhere on the boundary of C, by defnton: [ ]( ) = ( ) ( ) = φ ( ) ( ) H f p h p f C p f C Snce f(p) s lnear, second dervatves vansh, e: 2 = f( p) 0 and f(p) satsfes Laplace s equaton on the nteror of C Snce H[f](p) s a lnear combnaton of harmonc functons, t also satsfes Laplace s equaton Use proof by nducton to generalze to any n-dmenson

Results Cage Vertces 325 112 39 27 Object Vertces 9775 8019 269 136 Grd resoluton 5 5 4 5 Solve tme 57.4 17.6 5.85 0.83 Pose tme 0.111 0.026 0.0001 0.0007 Soluton sze (MB) 9.2 3.7 0.32 0.048 Error: < 0.005 Total footprnt: < 90MB

Future Work: Compute the harmonc coordnates for each cage vertex ndependently and n parallel Better solvers (currently usng MultGrd) Octrees Localze re-solves