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

Size: px
Start display at page:

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

Transcription

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

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

3 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 w w w The weghts are called barycentrc coordnates (Möbus, 1827, Der Barycentrsche Calcul)

4 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

5 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?

6 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

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

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

9 Wachspress Coordnates Rephrasng the expresson: A A B sn( ) v v v v 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.

10 Wachspress Interpolaton It s evdent that nonconvex regons have poles

11 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.

12 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

13 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

14 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

15 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) f ( C( t)) d( C( t)) 1 d( C( t)) d d

16 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

17 Mean Value Coordnates Defned anywhere n the plane

18 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

19 Comparson Three Pont Coordnates

20 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

21 Applcatons: Vector Feld Interpolaton

22 Applcatons: Image Warpng

23 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

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

Harmonic Coordinates for Character Articulation PIXAR

Harmonic Coordinates for Character Articulation PIXAR 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

More information

Some Tutorial about the Project. Computer Graphics

Some Tutorial about the Project. Computer Graphics Some Tutoral about the Project Lecture 6 Rastersaton, Antalasng, Texture Mappng, I have already covered all the topcs needed to fnsh the 1 st practcal Today, I wll brefly explan how to start workng on

More information

A Unified, Integral Construction For Coordinates Over Closed Curves

A Unified, Integral Construction For Coordinates Over Closed Curves A Unfed, Integral Constructon For Coordnates Over Closed Curves Schaefer S., Ju T. and Warren J. Abstract We propose a smple generalzaton of Shephard s nterpolaton to pecewse smooth, convex closed curves

More information

Scan Conversion & Shading

Scan Conversion & Shading Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Scan Conversion & Shading

Scan Conversion & Shading 1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Radial Basis Functions

Radial Basis Functions Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of

More information

Injective Shape Deformations Using Cube-Like Cages

Injective Shape Deformations Using Cube-Like Cages 309 Injectve Shape Deformatons Usng Cube-Lke Cages Jr Kosnka 1 and Mchael Barton 2 1 Unversty of Oslo, jr.kosnka@cma.uo.no 2 Technon, barton@cs.technon.ac.l ABSTRACT The present paper nvestgates an applcaton

More information

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

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Parameterization of Quadrilateral Meshes

Parameterization of Quadrilateral Meshes Parameterzaton of Quadrlateral Meshes L Lu 1, CaMng Zhang 1,, and Frank Cheng 3 1 School of Computer Scence and Technology, Shandong Unversty, Jnan, Chna Department of Computer Scence and Technology, Shandong

More information

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

Power Coordinates: A Geometric Construction of Barycentric Coordinates on Convex Polytopes Power Coordnates: A Geometrc Constructon of Barycentrc Coordnates on Convex Polytopes Max Budnnsky Caltech Bebe Lu Caltech Yyng Tong MSU Matheu Desbrun Caltech Abstract We present a full geometrc parameterzaton

More information

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

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model Color n OpenGL Polygonal Shadng Lght Source n OpenGL Materal Propertes Normal Vectors Phong model 2 We know how to rasterze - Gven a 3D trangle and a 3D vewpont, we know whch pxels represent the trangle

More information

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

Smooth Approximation to Surface Meshes of Arbitrary Topology with Locally Blended Radial Basis Functions 587 Smooth Approxmaton to Surface eshes of Arbtrary Topology wth Locally Blended Radal Bass Functons ngyong Pang 1,, Weyn a 1, Zhgeng Pan and Fuyan Zhang 1 Cty Unversty of Hong Kong, mewma@ctyu.edu.hk

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Computer Vision. Exercise Session 1. Institute of Visual Computing

Computer Vision. Exercise Session 1. Institute of Visual Computing Computer Vson Exercse Sesson 1 Organzaton Teachng assstant Basten Jacquet CAB G81.2 basten.jacquet@nf.ethz.ch Federco Camposeco CNB D12.2 fede@nf.ethz.ch Lecture webpage http://www.cvg.ethz.ch/teachng/compvs/ndex.php

More information

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

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

Mesh Editing in ROI with Dual Laplacian

Mesh Editing in ROI with Dual Laplacian Mesh Edtng n ROI wth Dual Laplacan Luo Qong, Lu Bo, Ma Zhan-guo, Zhang Hong-bn College of Computer Scence, Beng Unversty of Technology, Chna lqngng@sohu.com, lubo@but.edu.cn,mzgsy@63.com,zhb@publc.bta.net.cn

More information

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

Computer Graphics. - Spline and Subdivision Surfaces - Hendrik Lensch. Computer Graphics WS07/08 Spline & Subdivision Surfaces Computer Graphcs - Splne and Subdvson Surfaces - Hendrk Lensch Overvew Last Tme Image-Based Renderng Today Parametrc Curves Lagrange Interpolaton Hermte Splnes Bezer Splnes DeCasteljau Algorthm Parameterzaton

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Fundamentals of Spherical Parameterization for 3D Meshes

Fundamentals of Spherical Parameterization for 3D Meshes Fundamentals of Sphercal Parameterzaton for 3D Meshes Crag Gotsman Xanfeng Gu Alla Sheffer gotsman@cs.technon.ac.l gu@eecs.harvard.edu sheffa@cs.technon.ac.l Technon Israel Inst. of Tech. Harvard Unversty

More information

Research Article Quasi-Bézier Curves with Shape Parameters

Research Article Quasi-Bézier Curves with Shape Parameters Hndaw Publshng Corporaton Appled Mathematcs Volume 3, Artcle ID 739, 9 pages http://dxdoorg/55/3/739 Research Artcle Quas-Bézer Curves wth Shape Parameters Jun Chen Faculty of Scence, Nngbo Unversty of

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Inverse-Polar Ray Projection for Recovering Projective Transformations

Inverse-Polar Ray Projection for Recovering Projective Transformations nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced

More information

Discrete Schemes for Gaussian Curvature and Their Convergence

Discrete Schemes for Gaussian Curvature and Their Convergence Dscrete Schemes for Gaussan Curvature and Ther Convergence Zhqang Xu Guolang Xu Insttute of Computatonal Math. and Sc. and Eng. Computng, Academy of Mathematcs and System Scences, Chnese Academy of Scences,

More information

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

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

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

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Optimal Quadrilateral Finite Elements on Polygonal Domains

Optimal Quadrilateral Finite Elements on Polygonal Domains J Sc Comput (2017) 70:60 84 DOI 10.1007/s10915-016-0242-5 Optmal Quadrlateral Fnte Elements on Polygonal Domans Hengguang L 1 Qnghu Zhang 2 Receved: 30 January 2015 / Revsed: 21 January 2016 / Accepted:

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

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,

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, Dscrete Farng of Curves and Surfaces Based on Lnear Curvature Dstrbuton R. Schneder and L. Kobbelt Abstract. In the planar case, one possblty to create a hgh qualty curve that nterpolates a gven set of

More information

Modelization of Acoustic Waves Radiation from Sources of Complex Geometry Aperture

Modelization of Acoustic Waves Radiation from Sources of Complex Geometry Aperture coustcs 8 ars odelzaton of coustc Waves Radaton from Sources of Complex Geometry perture R. Serhane and T. Boutedjrt Unversté des Scences et de la Technologe Houar Boumedene; Faculté de hysque, B, El-la,

More information

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

Computers and Mathematics with Applications. Discrete schemes for Gaussian curvature and their convergence Computers and Mathematcs wth Applcatons 57 (009) 87 95 Contents lsts avalable at ScenceDrect Computers and Mathematcs wth Applcatons journal homepage: www.elsever.com/locate/camwa Dscrete schemes for Gaussan

More information

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

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids) Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes

More information

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More information

Wegelerstraße Bonn. Germany phone fax Maharavo Randrianarivony

Wegelerstraße Bonn. Germany phone fax Maharavo Randrianarivony Wegelerstraße 6. 53115 Bonn. Germany phone +49 228 73-3427. fax +49 228 73-7527 www.ns.un-bonn.de Maharavo Randranarvony COONS GENERALIZATION FOR POLYTOPES INS Preprnt 1. Introducton Over the last decades,

More information

11. APPROXIMATION ALGORITHMS

11. APPROXIMATION ALGORITHMS Copng wth NP-completeness 11. APPROXIMATION ALGORITHMS load balancng center selecton prcng method: vertex cover LP roundng: vertex cover generalzed load balancng knapsack problem Q. Suppose I need to solve

More information

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

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

Subdividing Barycentric Coordinates

Subdividing Barycentric Coordinates Subdvdng Barycentrc Coordnates Dtry Ansov Chongyang Deng Ka Horann Abstract Barycentrc coordnates are coonly used to represent a pont nsde a polygon as an affne cobnaton of the polygon s vertces and to

More information

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

Shape Control of the Cubic Trigonometric B-Spline Polynomial Curve with A Shape Parameter Internatonal Journal of Scences & Appled esearch www.jsar.n Shape Control of the Cubc Trgonometrc B-Splne Polynomal Curve wth A Shape Parameter Urvash Mshra* Department of Mathematcs, Mata Gujr Mahla Mahavdyalaya,

More information

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

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

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

Robust Curvature Estimation and Geometry Analysis of 3D point Cloud Surfaces Robust Curvature Estmaton and Geometry Analyss of 3D pont Cloud Surfaces Xaopeng ZHANG, Hongjun LI, Zhangln CHENG, Ykuan ZHANG Sno-French Laboratory LIAMA, Insttute of Automaton, CAS, Bejng 100190, Chna

More information

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

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces 7 Interpolaton of the Irregular Curve Network of Shp Hull Form Usng Subdvson Surfaces Kyu-Yeul Lee, Doo-Yeoun Cho and Tae-Wan Km Seoul Natonal Unversty, kylee@snu.ac.kr,whendus@snu.ac.kr,taewan}@snu.ac.kr

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Image Alignment CSC 767

Image Alignment CSC 767 Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Structure from Motion

Structure from Motion Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton

More information

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

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay, Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery

More information

Complex Filtering and Integration via Sampling

Complex Filtering and Integration via Sampling Overvew Complex Flterng and Integraton va Samplng Sgnal processng Sample then flter (remove alases) then resample onunform samplng: jtterng and Posson dsk Statstcs Monte Carlo ntegraton and probablty theory

More information

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

PHYS 219 Spring semester Lecture 20: Reflection of Electromagnetic Radiation: Mirrors and Images Formed by Mirrors PHYS 219 Sprng semester 2014 Lecture 20: eflecton of Electromagnetc adaton: Mrrors and Images Formed by Mrrors on efenberger Brck Nanotechnology Center Purdue Unversty Lecture 20 1 evew: Snapshot of an

More information

Multi-stable Perception. Necker Cube

Multi-stable Perception. Necker Cube Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008

More information

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

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

Line Clipping by Convex and Nonconvex Polyhedra in E 3

Line Clipping by Convex and Nonconvex Polyhedra in E 3 Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz

More information

5 The Primal-Dual Method

5 The Primal-Dual Method 5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton

More information

FLOW POLYTOPES OF PARTITIONS

FLOW POLYTOPES OF PARTITIONS FLOW POLYTOPES OF PARTITIONS KAROLA MÉSZÁROS, CONNOR SIMPSON, AND ZOE WELLNER Abstract. Recent progress on flow polytopes ndcates many nterestng famles wth product formulas for ther volume. These product

More information

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

Lecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method Lecture Note 08 EECS 4101/5101 Instructor: Andy Mrzaan Introducton All Nearest Neghbors: The Lftng Method Suose we are gven aset P ={ 1, 2,..., n }of n onts n the lane. The gven coordnates of the -th ont

More information

arxiv: v2 [math.na] 26 Apr 2016

arxiv: v2 [math.na] 26 Apr 2016 CONSTRUCTION OF SCALAR AND VECTOR FINITE ELEMENT FAMILIES ON POLYGONAL AND POLYHEDRAL MESHES ANDREW GILLETTE, ALEXANDER RAND, AND CHANDRAJIT BAJAJ Abstract. We combne theoretcal results from polytope doman

More information

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

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Simplification of 3D Meshes

Simplification of 3D Meshes Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Interactive Rendering of Translucent Objects

Interactive Rendering of Translucent Objects Interactve Renderng of Translucent Objects Hendrk Lensch Mchael Goesele Phlppe Bekaert Jan Kautz Marcus Magnor Jochen Lang Hans-Peter Sedel 2003 Presented By: Mark Rubelmann Outlne Motvaton Background

More information

Face numbers of nestohedra

Face numbers of nestohedra Face numbers of nestohedra from Faces of generalzed permutohedra, math.co/0609184 jont wth A. Postnkov and L. Wllams. Mnsymposum Algebrasche und geometrsche Kombnatork Erlangen 16 September 2008 Vc Rener

More information

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

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley

More information

Local Quaternary Patterns and Feature Local Quaternary Patterns

Local Quaternary Patterns and Feature Local Quaternary Patterns Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Distance based similarity measures of fuzzy sets

Distance based similarity measures of fuzzy sets Johanyák, Z. C., Kovács S.: Dstance based smlarty measures of fuzzy sets, SAMI 2005, 3 rd Slovakan-Hungaran Jont Symposum on Appled Machne Intellgence, Herl'any, Slovaka, January 2-22 2005, ISBN 963 75

More information

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

XY-Theta Positioning Table with Parallel Kinematics and Unlimited Theta Rotation XY-heta Postonng able wth Parallel Knematcs and Unlmted heta Rotaton Ilan A. Bonev 1, Aleander Yu 2, Paul Zsombor-Murra 2 1 Department of Automated Manufacturng Engneerng, École de echnologe Supéreure,

More information

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

A weighted least squares particle-in-cell method for solid mechanics INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2009; 0:1 6 [Verson: 2002/09/18 v2.02] A weghted least squares partcle-n-cell method for sold mechancs P. C. Wallstedt,

More information

Cell Count Method on a Network with SANET

Cell Count Method on a Network with SANET CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan

More information

1 Linear and Nonlinear Subdivision Schemes in Geometric Modeling

1 Linear and Nonlinear Subdivision Schemes in Geometric Modeling 1 Lnear and Nonlnear Subdvson Schemes n Geometrc Modelng Nra dyn School of Mathematcal Scences Tel Avv Unversty Tel Avv, Israel e-mal: nradyn@post.tau.ac.l Abstract Subdvson schemes are effcent computatonal

More information

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

Shape Preserving Positive and Convex Data Visualization using Rational Bi-cubic Functions Shape Preservng Postve and Conve Data Vsualzaton usng Ratonal B-cubc unctons Muhammad Sarfraz Malk Zawwar Hussan 3 Tahra Sumbal Shakh Department of Informaton Scence Adala Campus Kuwat Unverst Kuwat E-mal:

More information

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

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

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

G 2 Surface Modeling Using Minimal Mean-Curvature-Variation Flow G 2 Surface Modelng Usng Mnmal Mean-Curvature-Varaton Flow Guolang Xu 1 Qn Zhang 2 1,2 LSEC, Insttute of Computatonal Mathematcs, Academy of Mathematcs and System Scences, Chnese Academy of Scences, Bejng

More information

Computational Geometry: Theory and Applications

Computational Geometry: Theory and Applications JID:COMGEO AID:1238 /FLA [m3g; v 1.87; Prn:22/11/2012; 15:16] P.1 (1-25) Computatonal Geometry ( ) Contents lsts avalable at ScVerse ScenceDrect Computatonal Geometry: Theory and Applcatons www.elsever.com/locate/comgeo

More information

Polyhedral Surface Smoothing with Simultaneous Mesh Regularization

Polyhedral Surface Smoothing with Simultaneous Mesh Regularization olyhedral Surface Smoothng wth Smultaneous Mesh Regularzaton Yutaka Ohtake The Unversty of Azu Azu-Wakamatsu Cty Fukushma 965-8580 Japan d800@u-azu.ac.jp Alexander G. Belyaev The Unversty of Azu Azu-Wakamatsu

More information

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

(1) The control processes are too complex to analyze by conventional quantitative techniques. Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a

More information

Geometric Error Estimation

Geometric Error Estimation Geometrc Error Estmaton Houman Borouchak Project-team GAMMA 3 UTT Troyes, France Emal: houman.borouchak@utt.fr Patrck Laug Project-team GAMMA 3 INRIA Pars - Rocquencourt, France Emal: patrck.laug@nra.fr

More information

FINDING efficient algorithms to describe, measure, and

FINDING efficient algorithms to describe, measure, and 466 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 36, NO. 3, MARCH 2014 Automatc Algnment of Genus-Zero Surfaces Patrce Koehl and Joel Hass Abstract A new algorthm s presented that

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

On the diameter of random planar graphs

On the diameter of random planar graphs On the dameter of random planar graphs Gullaume Chapuy, CNRS & LIAFA, Pars jont work wth Érc Fusy, Pars, Omer Gménez, ex-barcelona, Marc Noy, Barcelona. Probablty and Graphs, Eurandom, Endhoven, 04. Planar

More information

Discontinuous Galerkin methods for flow and transport problems in porous media

Discontinuous Galerkin methods for flow and transport problems in porous media T COMMUNICATIONS IN NUMERICA METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2; :1 6 [Verson: 2/3/22 v1.] Dscontnuous Galerkn methods for flow and transport problems n porous meda Béatrve Rvère and Mary

More information

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

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

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

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like: Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A

More information

Parallel Computation of the Functions Constructed with

Parallel Computation of the Functions Constructed with PDCS 013 (Ukrane, Kharkv, March 13-14, 013) Parallel Computaton of the Functons Constructed wth R-operatons usng CUDA Roman A. Uvarov Podgorny Insttute for Mechancal Engneerng Problems of NAS of Ukrane,

More information

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

On 3D DDFV discretization of gradient and divergence operators. I. Meshing, operators and discrete duality. On 3D DDFV dscretzaton of gradent and dvergence operators. I. Meshng, operators and dscrete dualty. Bors Andreanov, Mostafa Bendahmane, Florence Hubert, Stella Krell To cte ths verson: Bors Andreanov,

More information

2-Dimensional Image Representation. Using Beta-Spline

2-Dimensional Image Representation. Using Beta-Spline Appled Mathematcal cences, Vol. 7, 03, no. 9, 4559-4569 HIKARI Ltd, www.m-hkar.com http://dx.do.org/0.988/ams.03.3359 -Dmensonal Image Representaton Usng Beta-plne Norm Abdul Had Faculty of Computer and

More information

CHAPTER 2 DECOMPOSITION OF GRAPHS

CHAPTER 2 DECOMPOSITION OF GRAPHS CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng

More information

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF Johannes Leebmann Insttute of Photogrammetry and Remote Sensng, Unversty of Karlsruhe (TH, Englerstrasse 7, 7618 Karlsruhe, Germany - leebmann@pf.un-karlsruhe.de

More information

Concurrent models of computation for embedded software

Concurrent models of computation for embedded software Concurrent models of computaton for embedded software and hardware! Researcher overvew what t looks lke semantcs what t means and how t relates desgnng an actor language actor propertes and how to represent

More information

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

Form-factors Josef Pelikán CGG MFF UK Praha. Form-factors 1996-2016 Josef Pelkán CGG MFF UK Praha pepca@cgg.mff.cun.cz http://cgg.mff.cun.cz/~pepca/ FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 1 / 23 Form-factor F It ndcates the proporton

More information

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

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

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

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

Fair Triangle Mesh Generation with Discrete Elastica

Fair Triangle Mesh Generation with Discrete Elastica Far Trangle Mesh Generaton wth Dscrete Elastca Shn Yoshzawa, and Alexander G. Belyaev, Computer Graphcs Group, Max-Planck-Insttut für Informatk, 66123 Saarbrücken, Germany Phone: [+49](681)9325-414 Fax:

More information

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

Accelerating X-Ray data collection using Pyramid Beam ray casting geometries Acceleratng X-Ray data collecton usng Pyramd Beam ray castng geometres Amr Averbuch Guy Lfchtz Y. Shkolnsky 3 School of Computer Scence Department of Appled Mathematcs, School of Mathematcal Scences Tel

More information