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

Similar documents
Harmonic Coordinates for Character Articulation PIXAR

Some Tutorial about the Project. Computer Graphics

A Unified, Integral Construction For Coordinates Over Closed Curves

Scan Conversion & Shading

Scan Conversion & Shading

Reading. 14. Subdivision curves. Recommended:

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Radial Basis Functions

Injective Shape Deformations Using Cube-Like Cages

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

Parameterization of Quadrilateral Meshes

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

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

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

LECTURE : MANIFOLD LEARNING

GSLM Operations Research II Fall 13/14

Machine Learning 9. week

Programming in Fortran 90 : 2017/2018

S1 Note. Basis functions.

Computer Vision. Exercise Session 1. Institute of Visual Computing

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

Mesh Editing in ROI with Dual Laplacian

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

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Lecture #15 Lecture Notes

Fundamentals of Spherical Parameterization for 3D Meshes

Research Article Quasi-Bézier Curves with Shape Parameters

Problem Set 3 Solutions

Inverse-Polar Ray Projection for Recovering Projective Transformations

Discrete Schemes for Gaussian Curvature and Their Convergence

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

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Support Vector Machines

Optimal Quadrilateral Finite Elements on Polygonal Domains

Multiblock method for database generation in finite element programs

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,

Modelization of Acoustic Waves Radiation from Sources of Complex Geometry Aperture

Computers and Mathematics with Applications. Discrete schemes for Gaussian curvature and their convergence

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

UNIT 2 : INEQUALITIES AND CONVEX SETS

Wegelerstraße Bonn. Germany phone fax Maharavo Randrianarivony

11. APPROXIMATION ALGORITHMS

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

Subdividing Barycentric Coordinates

Shape Control of the Cubic Trigonometric B-Spline Polynomial Curve with A Shape Parameter

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

Robust Curvature Estimation and Geometry Analysis of 3D point Cloud Surfaces

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

Smoothing Spline ANOVA for variable screening

Image Alignment CSC 767

High-Boost Mesh Filtering for 3-D Shape Enhancement

Structure from Motion

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Complex Filtering and Integration via Sampling

PHYS 219 Spring semester Lecture 20: Reflection of Electromagnetic Radiation: Mirrors and Images Formed by Mirrors

Multi-stable Perception. Necker Cube

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Line Clipping by Convex and Nonconvex Polyhedra in E 3

5 The Primal-Dual Method

FLOW POLYTOPES OF PARTITIONS

Lecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method

arxiv: v2 [math.na] 26 Apr 2016

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

Simplification of 3D Meshes

Hermite Splines in Lie Groups as Products of Geodesics

Interactive Rendering of Translucent Objects

Face numbers of nestohedra

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements

Local Quaternary Patterns and Feature Local Quaternary Patterns

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

Distance based similarity measures of fuzzy sets

XY-Theta Positioning Table with Parallel Kinematics and Unlimited Theta Rotation

A weighted least squares particle-in-cell method for solid mechanics

Cell Count Method on a Network with SANET

1 Linear and Nonlinear Subdivision Schemes in Geometric Modeling

Shape Preserving Positive and Convex Data Visualization using Rational Bi-cubic Functions

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

G 2 Surface Modeling Using Minimal Mean-Curvature-Variation Flow

Computational Geometry: Theory and Applications

Polyhedral Surface Smoothing with Simultaneous Mesh Regularization

(1) The control processes are too complex to analyze by conventional quantitative techniques.

Geometric Error Estimation

FINDING efficient algorithms to describe, measure, and

Machine Learning: Algorithms and Applications

On the diameter of random planar graphs

Discontinuous Galerkin methods for flow and transport problems in porous media

A New Approach For the Ranking of Fuzzy Sets With Different Heights

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

Parallel Computation of the Functions Constructed with

On 3D DDFV discretization of gradient and divergence operators. I. Meshing, operators and discrete duality.

2-Dimensional Image Representation. Using Beta-Spline

CHAPTER 2 DECOMPOSITION OF GRAPHS

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF

Concurrent models of computation for embedded software

Form-factors Josef Pelikán CGG MFF UK Praha.

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

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

Fair Triangle Mesh Generation with Discrete Elastica

Accelerating X-Ray data collection using Pyramid Beam ray casting geometries

Transcription:

Barycentrc Coordnates From: Mean Value Coordnates for Closed Trangular Meshes by Ju et al.

Motvaton Data nterpolaton from the vertces of a boundary polygon to ts nteror Boundary value problems Shadng Space deformatons Parametrzaton

Barycentrc Coordnates n Trangles A pont v s the weghted barycenter n a trangle {v 1, v 2, v 3 }, wth weghts {w 1, w 2, w 3 } f: v w v w v w v 1 1 2 2 3 3 w w w 1 2 3 The weghts are called barycentrc coordnates (Möbus, 1827, Der Barycentrsche Calcul)

Barycentrc Coordnates n Trangles The barycentrc coordnates n a trangle are unque Up to a constant scalng factor Normalzed (unque) barycentrc coordnates: 3 w 1 w

Barycentrc coordnates n Trangles Propertes: Lagrange: ( v j ) j Postvty: 0 Lnearty Lnear Interpolaton of data: 3 f ( v) ( v) f 1 How do barycentrc coordnates generalze to general polygons?

Generalzed Barycentrc Coordnates Homogeneous coordnates w : w () v 1 Generalzed coordnates: 1 Propertes: Partton of unty: v Reproducton: j n 1 n () v w () v v n w () v n 1 j w() v Lnear Reproducton (for lnear ф) n 1 n 1 ( v) ( v) ( v) 1 () v v v

Generalzed Barycentrc Coordnates Not unque. Many types proposed. We wll study three man coordnates: Wachspress Harmonc Mean value

Wachspress Coordnates Only apply to convex polygons Three ponts constructon: w A A B 1 A 1 A The areas are sgned!

Wachspress Coordnates Rephrasng the expresson: A A B sn( ) v v v v 1 1 1 1 2 AA 1 sn( 1) v v 1 v p sn( ) v v 1 sn( 1) cot( 1) cot( ) 2 2 sn( )sn( ) v p v p 1 Every coordnate depends on the vertex ts neghbors Such coordnates are called threepont coordnates.

Wachspress Interpolaton It s evdent that nonconvex regons have poles

Wachspress Coordnates Not well defned on concave polygons Negatve weghts, whch mght lead to poles (zero weght sum). Not defned on the boundary Lmt exsts.

Harmonc Coordnates Assgn 1 to vertex v, and 0 to all other vertces Weght vary lnearly on edges Solve Laplace equaton nsde polygon: 0 ( ) v j j

Harmonc Coordnates Well-defned and postve for arbtrarly-defned polygons Laplace equaton lnear nteror s the harmonc nterpolant of boundary values. Lnear precson Man setback no closed form Hard to compute Usually solved by dscretzaton

Mean Value Coordnates A closed-form approxmaton of harmonc nterpolaton. Harmonc functon hold the mean-value property: 1 f ( x) f ( t) dt C For crcles around the pont x. C

Mean-Value Interpolant Idea - project the boundary curve unto a unt sphere around the pont Integrate by projecton angles, wth respect to projecton dstance: f( x) 2 0 2 0 f ( C( t)) d( C( t)) 1 d( C( t)) d d

Dscrete Boundary Boundary s pecewse-lnear (Polygon) The ntegral over one edge [P 0,P 1 ] becomes: 2 1 f( C( )) f( p0 ) f( p1 ) 1 0 d tan d( C( )) d( p0, x) d( p1, x) 2 Rearrangng terms to be per-vertex we get: w( x) 1 tan tan 2 2 v x

Mean Value Coordnates Defned anywhere n the plane

Dscrete Harmonc coordnates MVC - three-pont coordnates as well Another member of ths famly: Dscrete Harmonc coordnates (cotan weghts) w( x) cot( a) cot( b) 2 DHC can also have poles

Comparson Three Pont Coordnates

Applcatons: Space Deformaton Each nternal pont x has a set of barycentrc coordnates Old postons (vector data) of boundary: Lnear precson: nternal ponts are reproduced: x 1 New postons: 1 n v 1.. n n n 1 { u u } y u v 1.. vn

Applcatons: Vector Feld Interpolaton

Applcatons: Image Warpng

Applcatons: Parametrzaton Usng the barycentrc coordnates n each one-rng as edge weghts Postonng every pont as barycenter of ts 1-rng wth the weghts. Exercse: Dsk parametrzaton wth Unform Dscrete harmonc coordnates (lecture) Mean-value coordnates

Extensons 3D\nD coordnates Non affne-nvarant coordnates Green Coordnates Complex Coordnates