Shape Modeling and Geometry Processing
|
|
- Phoebe Watson
- 5 years ago
- Views:
Transcription
1 L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry
2 Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2
3 Differential Geometry Motivation Formalize geometric properties of shapes Smoothness Roi Poranne # 3
4 Differential Geometry Motivation Formalize geometric properties of shapes Smoothness Deformation Roi Poranne # 4
5 Differential Geometry Motivation Formalize geometric properties of shapes Smoothness Deformation Mappings Roi Poranne # 5
6 Differential Geometry Basics Geometry of manifolds Things that can be explored locally point + neighborhood Roi Poranne # 6
7 Differential Geometry Basics Geometry of manifolds Things that can be explored locally point + neighborhood manifold point Roi Poranne # 7
8 Differential Geometry Basics Geometry of manifolds Things that can be explored locally point + neighborhood manifold point Roi Poranne # 8
9 Differential Geometry Basics Geometry of manifolds Things that can be explored locally point + neighborhood continuous 1-1 mapping manifold point Roi Poranne # 9
10 Differential Geometry Basics Geometry of manifolds Things that can be explored locally point + neighborhood manifold point continuous 1-1 mapping non-manifold point Roi Poranne # 10
11 Differential Geometry Basics Geometry of manifolds Things that can be explored locally point + neighborhood manifold point continuous 1-1 mapping non-manifold point x Roi Poranne # 11
12 Differential Geometry Basics Geometry of manifolds Things that can be explored locally point + neighborhood Roi Poranne # 12
13 Differential Geometry Basics Geometry of manifolds Things that can be explored locally point + neighborhood continuous 1-1 mapping Roi Poranne # 13
14 Differential Geometry Basics Geometry of manifolds Things that can be explored locally point + neighborhood v continuous 1-1 mapping u If a sufficiently smooth mapping can be constructed, we can look at its first and second derivatives Tangents, normals, curvatures, curve angles Distances, topology Roi Poranne # 14
15 Differential Geometry of Curves
16 Planar Curves γ t = x t y t, t t 0, t 1 Roi Poranne # 16
17 Planar Curves γ t = x t y t, t t 0, t 1 Roi Poranne # 17
18 Planar Curves γ t = x t y t, t t 0, t 1 γ t = t t 2 Roi Poranne # 18
19 Planar Curves γ t = x t y t, t t 0, t 1 γ t = t t 2 γ t = t2 t 4 Roi Poranne # 19
20 Arc Length Parameterization Same curve has many parameterizations! Arc-length: equal speed of the parameter along the curve L(γ(t 1 ), γ(t 2 )) = t 1 t 2 Roi Poranne # 20
21 Secant A line through two points on the curve. Roi Poranne # 21
22 Secant A line through two points on the curve. Roi Poranne # 22
23 Secant A line through two points on the curve. Roi Poranne # 23
24 Tangent A line through two points on the curve. Roi Poranne # 24
25 Tangent The limit secant as two points come together. Roi Poranne # 25
26 Secant and Tangent Secant: line through p(p) p(q) Tangent:γ (P) = (x (P), y (P), ) T Roi Poranne # 26
27 Arc Length Parameterization Same curve has many parameterizations! Arc-length: equal speed of the parameter along the curve L(γ(t 1 ), γ(t 2 )) = t 1 t 2 γ t = 1 Roi Poranne # 27
28 Arc Length Parameterization Same curve has many parameterizations! Arc-length: equal speed of the parameter along the curve L(γ(t 1 What ), γ(t 2 it )) γ= t t is 1 not t 2 arc length? γ t = 1 Roi Poranne # 28
29 Arc Length Parameterization Re Curve Reparamterization γ(t) γ(p(t)) p: t 0, t 1 t 0, t 1 p t 0 Arc length reparamterization γ p t = 1 Roi Poranne # 29
30 Arc Length Parameterization Re Arc length reparamterization γ p t = 1 Let t q t = න Then t0 γ t p t = q 1 t Roi Poranne # 30
31 Tangent, normal, curvature Osculating circle p Roi Poranne # 31
32 Curvature Circle through three points on the curve Roi Poranne # 32
33 Curvature The limit circle as points come together. Roi Poranne # 33
34 Curvature The limit circle as points come together. Curvature κ = 1 r Roi Poranne # 34
35 Curving left or right Signed Curvature + Roi Poranne # 35
36 Gauss map n(t) Point on curve maps to point on unit circle. n t S 1 Roi Poranne # 36
37 Curvature = change in normal direction Absolute curvature (assuming arc length) via the Gauss map curve Gauss map curve Gauss map Roi Poranne # 37
38 Curvature Normal Assume t is arc-length parameter p ( t) nˆ( t) nˆ ( t) p(t) p (t) A multiresolution framework for variational subdivision, Kobbelt and Schröder, ACM TOG 17(4), 1998 Roi Poranne # 38
39 Curvature Normal Assume t is arc-length parameter p ( t) nˆ( t) p(t) nˆ ( t) p (t) The curvature defines the planar curve shape up to rotation and translation! Roi Poranne # 39
40 Turning Number, k Roi Poranne # 40
41 Turning Number, k Roi Poranne # 41
42 Turning Number Theorem +2 2 For a closed curve, the integral of curvature is an integer multiple of Roi Poranne # 42
43 Discrete Planar Curves Roi Poranne # 43
44 Discrete Planar Curves Piecewise linear curves Not smooth at vertices Can t take derivatives Goal :Generalize notions From the smooth world for the discrete case There is no one single way! Roi Poranne # 44
45 Sampling Connection between discrete and smooth Finite number of vertices each lying on the curve, connected by straight edges. Roi Poranne # 45
46 The Length of a Discrete Curve Sum of edge lengths p 2 p 3 p 4 p 1 Roi Poranne # 46
47 The Length of a Continuous Curve limit over a refinement sequence h = max edge length Roi Poranne # 47
48 Tangents, Normals On edges tangent is the unit vector along edge normal is the perpendicular vector Roi Poranne # 48
49 Many options Tangents, Normals On vertices Roi Poranne # 49
50 Many options Tangents, Normals On vertices Average the adjacent edge normals Roi Poranne # 50
51 Many options Tangents, Normals On vertices Average the adjacent edge normals Weighting by edge lengths Roi Poranne # 51
52 Many options Tangents, Normals On vertices Average the adjacent edge normals Weighting by edge lengths Roi Poranne # 52
53 Many options Tangents, Normals On vertices Average the adjacent edge normals Weighting by edge lengths Roi Poranne # 53
54 Curvature of a Discrete Curve Again: change in normal direction no change along each edge curvature is zero along edges Roi Poranne # 54
55 Curvature of a Discrete Curve Again: change in normal direction no change along each edge curvature is zero along edges Roi Poranne # 55
56 Curvature of a Discrete Curve Again: change in normal direction normal changes at vertices record the turning angle! Roi Poranne # 56
57 Curvature of a Discrete Curve Again: change in normal direction normal changes at vertices record the turning angle! Roi Poranne # 57
58 Curvature of a Discrete Curve Again: change in normal direction normal changes at vertices record the turning angle! Roi Poranne # 58
59 Curvature of a Discrete Curve Again: change in normal direction same as the turning angle between the edges Roi Poranne # 59
60 Curvature of a Discrete Curve Zero along the edges Turning angle at the vertices = the change in normal direction 1 2 1, 2 > 0, 3 < 0 3 Roi Poranne # 60
61 Total Signed Curvature Sum of turning angles Roi Poranne # 61
62 Discrete Gauss Map Edges map to points, vertices map to arcs. Roi Poranne # 62
63 Discrete Gauss Map Turning number well defined for discrete curves. Roi Poranne # 63
64 Discrete Turning Number Theorem For a closed curve, the total signed curvature is an integer multiple of 2. proof: sum of exterior angles Roi Poranne # 64
65 Turning Number Theorem Continuous world Discrete world k: Roi Poranne # 65
66 Curvature is scale dependent is scale-independent Roi Poranne # 66
67 Discrete Curvature Integrated Quantity! Cannot view α i as pointwise curvature 1 2 It is integrated curvature over a local area associated with vertex i Roi Poranne # 67
68 Discrete Curvature Integrated Quantity! Integrated over a local area associated with vertex i A Roi Poranne # 68
69 Discrete Curvature Integrated Quantity! Integrated over a local area associated with vertex i 1 2 A 1 A 2 Roi Poranne # 69
70 Discrete Curvature Integrated Quantity! Integrated over a local area associated with vertex i 1 2 A 1 A 2 The vertex areas A i form a covering of the curve. They are pairwise disjoint (except endpoints). Roi Poranne # 70
71 Discrete analogues Arbitrary discrete curve total signed curvature obeys discrete turning number theorem even coarse mesh (curve) which continuous theorems to preserve? that depends on the application Roi Poranne # 71
72 Convergence length of sampled polygon approaches length of smooth curve in general, discrete measures approaches continuous analogues How to refine? depends on discrete operator pathological sequences may exist in what sense does the operator converge? (pointwise, L 2 ; linear, quadratic) Roi Poranne # 72
73 Differential Geometry of Surfaces
74 Surfaces, Parametric Form Continuous surface n p u p v p(u,v) Tangent plane at point p(u,v) is spanned by v These vectors don t have to be orthogonal u Roi Poranne # 74
75 Isoparametric Lines Lines on the surface when keeping one parameter fixed v u Roi Poranne # 75
76 Surfaces, Parametric Form Continuous surface n p u p v p(u,v) Tangent plane at point p(u,v) is spanned by v These vectors don t have to be orthogonal u Roi Poranne # 76
77 Surface Normals Surface normal: n p u p v p(u,v) v u Roi Poranne # 77
78 Surface Normals Surface normal: n p u p v p(u,v) Regular parameterization v u Roi Poranne # 78
79 Normal Curvature Roi Poranne # 79
80 Normal Curvature n p u p v t p t in the tangent plane (if p u and p v are orthogonal): t Tangent plane Roi Poranne # 80
81 Normal Curvature p u n p v The curve is the intersection of the surface with the plane through n and t. t p Normal curvature: n ( ) = ( (p)) Roi Poranne # 81
82 Surface Curvatures Principal curvatures Minimal curvature Maximal curvature Mean curvature Gaussian curvature Roi Poranne # 82
83 Principal Directions Principal directions: tangent vectors corresponding to max and min t 2 t 1 min tangent plane min curvature max curvature Roi Poranne # 83
84 Principal Directions Principal directions: tangent vectors corresponding to max and min What can we say about the principal directions? t 2 t 1 min tangent plane min curvature max curvature Roi Poranne # 84
85 Principal Directions Euler s Theorem: Principal directions are orthogonal. Roi Poranne # 85
86 Principal Directions Roi Poranne # 86
87 Mean Curvature Roi Poranne # 87
88 Gaussian Curvature Classification A point p on the surface is called Elliptic, if K > 0 Parabolic, if K = 0 Hyperbolic, if K < 0 Developable surface iff K = 0 Roi Poranne # 88
89 Local Surface Shape By Curvatures K > 0, 1 = 2 K = 0 Isotropic: all directions are principal directions spherical (umbilical) planar K > 0 K = 0 K < 0 Anisotropic: 2 distinct principal directions 1 > 0, 2 > 0 2 > 0 1 = 0 2 > 0 1 < 0 elliptic parabolic hyperbolic Roi Poranne # 89
90 Theorema Egregium Remarkable theorem Roi Poranne # 90
91 Reminder: Euler-Poincaré Formula For orientable meshes: c = number of connected components g = genus b = number of boundary loops Roi Poranne # 91
92 Gauss-Bonnet Theorem For a closed surface M: Roi Poranne # 92
93 Gauss-Bonnet Theorem For a closed surface M: Compare with planar curves: Roi Poranne # 93
94 Fundamental Forms First fundamental form Roi Poranne # 94
95 Fundamental Forms I is a generalization of the dot product allows to measure length, angles, area, curvature arc element area element Roi Poranne # 95
96 Intrinsic Geometry Properties of the surface that only depend on the first fundamental form length angles Gaussian curvature (Theorema Egregium) Roi Poranne # 96
97 Fundamental Forms First fundamental form Second fundamental form Together, they define a surface (if some compatibility conditions hold) Roi Poranne # 97
98 Laplace Operator Laplace operator gradient operator 2nd partial derivatives function in Euclidean space divergence operator Roi Poranne # 98
99 Laplace-Beltrami Operator Extension of Laplace to functions on manifolds Laplace- Beltrami gradient operator function on surface M divergence operator Roi Poranne # 99
100 Laplace-Beltrami Operator For coordinate functions: p x, y, z = (x, y, z) Laplace- Beltrami gradient operator mean curvature function on surface M divergence operator unit surface normal Roi Poranne # 100
101 Differential Geometry on Meshes Assumption: meshes are piecewise linear approximations of smooth surfaces Can try fitting a smooth surface locally (say, a polynomial) and find differential quantities analytically But: it is often too slow for interactive setting and error prone Roi Poranne # 101
102 Discrete Differential Operators Approach: approximate differential properties at point v as spatial average over local mesh neighborhood N(v) where typically v = mesh vertex N k (v) = k-ring neighborhood Roi Poranne # 102
103 Discrete Laplace-Beltrami v i v j Roi Poranne # 103
104 Discrete Laplace-Beltrami Uniform discretization: L(v) or v Depends only on connectivity = simple and efficient v i Bad approximation for irregular triangulations v j Roi Poranne # 104
105 Discrete Laplace-Beltrami Intuition for uniform discretization Roi Poranne # 105
106 Discrete Laplace-Beltrami Intuition for uniform discretization v i-1 v i v i+1 Roi Poranne # 106
107 Discrete Laplace-Beltrami Intuition for uniform discretization v j1 v j2 v j6 v i v j3 v j5 v j4 Roi Poranne # 107
108 Discrete Laplace-Beltrami Cotangent formula v i v i A i ij v i v j v j v j ij Roi Poranne # 108
109 Discrete Laplace-Beltrami Cotangent formula Accounts for mesh geometry Potentially negative/ infinite weights Roi Poranne # 109
110 Discrete Laplace-Beltrami Cotangent formula Can be derived using linear Finite Elements Nice property: gives zero for planar 1-rings! Roi Poranne # 110
111 Discrete Laplace-Beltrami v i Uniform Laplacian L u (v i ) Cotangent Laplacian L c (v i ) Normal v j Roi Poranne # 111
112 Discrete Laplace-Beltrami v i Uniform Laplacian L u (v i ) Cotangent Laplacian L c (v i ) Normal v j For nearly equal edge lengths Uniform Cotangent Roi Poranne # 112
113 Discrete Laplace-Beltrami v i Uniform Laplacian L u (v i ) Cotangent Laplacian L c (v i ) Normal v j For nearly equal edge lengths Uniform Cotangent Cotan Laplacian allows computing discrete normal Roi Poranne # 113
114 Mean curvature Discrete Curvatures Gaussian curvature A i j Principal curvatures Roi Poranne # 114
115 Discrete Gauss-Bonnet Theorem Total Gaussian curvature is fixed for a given topology Roi Poranne # 115
116 Discrete Gauss-Bonnet Theorem Total Gaussian curvature is fixed for a given topology Roi Poranne # 116
117 Discrete Gauss-Bonnet Theorem Total Gaussian curvature is fixed for a given topology Roi Poranne # 117
118 Example: Discrete Mean Curvature Roi Poranne # 118
119 Links and Literature M. Meyer, M. Desbrun, P. Schroeder, A. Barr Discrete Differential-Geometry Operators for Triangulated 2-Manifolds, VisMath, 2002 Roi Poranne # 119
120 Links and Literature libigl implements many discrete differential operators See the tutorial! orial/tutorial.html principal directions Roi Poranne # 120
121 Thank You
05 - Surfaces. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Daniele Panozzo
05 - Surfaces Acknowledgements: Olga Sorkine-Hornung Reminder Curves Turning Number Theorem Continuous world Discrete world k: Curvature is scale dependent is scale-independent Discrete Curvature Integrated
More informationCS 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 informationCS 523: Computer Graphics, Spring Shape Modeling. Differential Geometry of Surfaces
CS 523: Computer Graphics, Spring 2011 Shape Modeling Differential Geometry of Surfaces Andrew Nealen, Rutgers, 2011 2/22/2011 Differential Geometry of Surfaces Continuous and Discrete Motivation Smoothness
More informationShape 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(Discrete) Differential Geometry
(Discrete) Differential Geometry Motivation Understand the structure of the surface Properties: smoothness, curviness, important directions How to modify the surface to change these properties What properties
More information04 - 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 informationSurfaces: notes on Geometry & Topology
Surfaces: notes on Geometry & Topology 1 Surfaces A 2-dimensional region of 3D space A portion of space having length and breadth but no thickness 2 Defining Surfaces Analytically... Parametric surfaces
More informationLaplacian 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 informationLectures in Discrete Differential Geometry 3 Discrete Surfaces
Lectures in Discrete Differential Geometry 3 Discrete Surfaces Etienne Vouga March 19, 2014 1 Triangle Meshes We will now study discrete surfaces and build up a parallel theory of curvature that mimics
More informationDiscrete Differential Geometry: An Applied Introduction
Discrete Differential Geometry: An Applied Introduction Eitan Grinspun with Mathieu Desbrun, Konrad Polthier, Peter Schröder, & Ari Stern 1 Differential Geometry Why do we care? geometry of surfaces Springborn
More informationDigital 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 informationDISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017
DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU 15-458/858B Fall 2017 LECTURE 10: DISCRETE CURVATURE DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU 15-458/858B
More informationParameterization 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 informationCS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F:
CS 177 Homework 1 Julian Panetta October, 009 1 Euler Characteristic 1.1 Polyhedral Formula We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: V E + F = 1 First,
More informationIntroduction to geometry
1 2 Manifolds A topological space in which every point has a neighborhood homeomorphic to (topological disc) is called an n-dimensional (or n-) manifold Introduction to geometry The German way 2-manifold
More information274 Curves on Surfaces, Lecture 5
274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,
More informationGAUSS-BONNET FOR DISCRETE SURFACES
GAUSS-BONNET FOR DISCRETE SURFACES SOHINI UPADHYAY Abstract. Gauss-Bonnet is a deep result in differential geometry that illustrates a fundamental relationship between the curvature of a surface and its
More informationFace-based Estimations of Curvatures on Triangle Meshes
Journal for Geometry and Graphics Volume 12 (2008), No. 1, 63 73. Face-based Estimations of Curvatures on Triangle Meshes Márta Szilvási-Nagy Dept. of Geometry, Budapest University of Technology and Economics
More informationMesh 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 informationA GEOMETRIC APPROACH TO CURVATURE ESTIMATION ON TRIANGULATED 3D SHAPES
A GEOMETRIC APPROACH TO CURVATURE ESTIMATION ON TRIANGULATED 3D SHAPES Mohammed Mostefa Mesmoudi, Leila De Floriani, Paola Magillo Department of Computer Science and Information Science (DISI), University
More informationGeometric 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 informationThe World Is Not Flat: An Introduction to Modern Geometry
The World Is Not Flat: An to The University of Iowa September 15, 2015 The story of a hunting party The story of a hunting party What color was the bear? The story of a hunting party Overview Gauss and
More informationSmoothing & Fairing. Mario Botsch
Smoothing & Fairing Mario Botsch Motivation Filter out high frequency noise Desbrun, Meyer, Schroeder, Barr: Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow, SIGGRAPH 99 2 Motivation
More information1.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 informationLet and be a differentiable function. Let Then be the level surface given by
Module 12 : Total differential, Tangent planes and normals Lecture 35 : Tangent plane and normal [Section 35.1] > Objectives In this section you will learn the following : The notion tangent plane to a
More informationGeodesics 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 informationIntroduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry
Introduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry Representation Ab initio design Rendering Solid modelers Kinematic
More informationA Primer on Laplacians. Max Wardetzky. Institute for Numerical and Applied Mathematics Georg-August Universität Göttingen, Germany
A Primer on Laplacians Max Wardetzky Institute for Numerical and Applied Mathematics Georg-August Universität Göttingen, Germany Warm-up: Euclidean case Warm-up The Euclidean case Chladni s vibrating plates
More informationWhat is Geometry Processing? Understanding the math of 3D shape and applying that math to discrete shape
Geometry Processing What is Geometry Processing? Understanding the math of 3D shape and applying that math to discrete shape What is Geometry Processing? Understanding the math of 3D shape and applying
More informationGeometric Modeling Mortenson Chapter 11. Complex Model Construction
Geometric Modeling 91.580.201 Mortenson Chapter 11 Complex Model Construction Topics Topology of Models Connectivity and other intrinsic properties Graph-Based Models Emphasize topological structure Boolean
More informationDifferential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]
Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function
More informationGeometry and Gravitation
Chapter 15 Geometry and Gravitation 15.1 Introduction to Geometry Geometry is one of the oldest branches of mathematics, competing with number theory for historical primacy. Like all good science, its
More informationTriangle meshes I. CS 4620 Lecture Steve Marschner. Cornell CS4620 Spring 2017
Triangle meshes I CS 4620 Lecture 2 2017 Steve Marschner 1 spheres Andrzej Barabasz approximate sphere Rineau & Yvinec CGAL manual 2017 Steve Marschner 2 finite element analysis PATRIOT Engineering 2017
More informationInvariant Measures. The Smooth Approach
Invariant Measures Mathieu Desbrun & Peter Schröder 1 The Smooth Approach On this show lots of derivatives tedious expressions in coordinates For what? only to discover that there are invariant measures
More informationSOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS
SOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS JIAN LIANG AND HONGKAI ZHAO Abstract. In this paper we present a general framework for solving partial differential equations on manifolds represented
More informationThree Points Make a Triangle Or a Circle
Three Points Make a Triangle Or a Circle Peter Schröder joint work with Liliya Kharevych, Boris Springborn, Alexander Bobenko 1 In This Section Circles as basic primitive it s all about the underlying
More informationPreliminary Mathematics of Geometric Modeling (3)
Preliminary Mathematics of Geometric Modeling (3) Hongxin Zhang and Jieqing Feng 2006-11-27 State Key Lab of CAD&CG, Zhejiang University Differential Geometry of Surfaces Tangent plane and surface normal
More informationCS 468 (Spring 2013) Discrete Differential Geometry
CS 468 (Spring 2013) Discrete Differential Geometry 1 Math Review Lecture 14 15 May 2013 Discrete Exterior Calculus Lecturer: Justin Solomon Scribe: Cassidy Saenz Before we dive into Discrete Exterior
More informationHyplane Polyhedral Models of Hyperbolic Plane
Original Paper Forma, 21, 5 18, 2006 Hyplane Polyhedral Models of Hyperbolic Plane Kazushi AHARA Department of Mathematics School of Science and Technology, Meiji University, 1-1-1 Higashi-mita, Tama-ku,
More informationLectures 19: The Gauss-Bonnet Theorem I. Table of contents
Math 348 Fall 07 Lectures 9: The Gauss-Bonnet Theorem I Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams. In
More informationCS 468 (Spring 2013) Discrete Differential Geometry
Lecturer: Adrian Butscher, Justin Solomon Scribe: Adrian Buganza-Tepole CS 468 (Spring 2013) Discrete Differential Geometry Lecture 19: Conformal Geometry Conformal maps In previous lectures we have explored
More informationComputing Curvature CS468 Lecture 8 Notes
Computing Curvature CS468 Lecture 8 Notes Scribe: Andy Nguyen April 4, 013 1 Motivation In the previous lecture we developed the notion of the curvature of a surface, showing a bunch of nice theoretical
More informationGreedy Routing in Wireless Networks. Jie Gao Stony Brook University
Greedy Routing in Wireless Networks Jie Gao Stony Brook University A generic sensor node CPU. On-board flash memory or external memory Sensors: thermometer, camera, motion, light sensor, etc. Wireless
More informationGeometry Processing TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAA
Geometry Processing What is Geometry Processing? Understanding the math of 3D shape What is Geometry Processing? Understanding the math of 3D shape and applying that math to discrete shape What is Geometry
More informationDiscrete Surfaces. David Gu. Tsinghua University. Tsinghua University. 1 Mathematics Science Center
Discrete Surfaces 1 1 Mathematics Science Center Tsinghua University Tsinghua University Discrete Surface Discrete Surfaces Acquired using 3D scanner. Discrete Surfaces Our group has developed high speed
More informationImpulse Gauss Curvatures 2002 SSHE-MA Conference. Howard Iseri Mansfield University
Impulse Gauss Curvatures 2002 SSHE-MA Conference Howard Iseri Mansfield University Abstract: In Riemannian (differential) geometry, the differences between Euclidean geometry, elliptic geometry, and hyperbolic
More informationSurface Mesh Generation
Surface Mesh Generation J.-F. Remacle Université catholique de Louvain September 22, 2011 0 3D Model For the description of the mesh generation process, let us consider the CAD model of a propeller presented
More informationDistance 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 informationSIMPLICIAL ENERGY AND SIMPLICIAL HARMONIC MAPS
SIMPLICIAL ENERGY AND SIMPLICIAL HARMONIC MAPS JOEL HASS AND PETER SCOTT Abstract. We introduce a combinatorial energy for maps of triangulated surfaces with simplicial metrics and analyze the existence
More informationTriangle meshes I. CS 4620 Lecture 2
Triangle meshes I CS 4620 Lecture 2 2014 Steve Marschner 1 spheres Andrzej Barabasz approximate sphere Rineau & Yvinec CGAL manual 2014 Steve Marschner 2 finite element analysis PATRIOT Engineering 2014
More informationEuler s Theorem. Brett Chenoweth. February 26, 2013
Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s
More informationDiscrete minimal surfaces of Koebe type
Discrete minimal surfaces of Koebe type Alexander I. Bobenko, Ulrike Bücking, Stefan Sechelmann March 5, 2018 1 Introduction Minimal surfaces have been studied for a long time, but still contain unsolved
More informationGeodesic and curvature of piecewise flat Finsler surfaces
Geodesic and curvature of piecewise flat Finsler surfaces Ming Xu Capital Normal University (based on a joint work with S. Deng) in Southwest Jiaotong University, Emei, July 2018 Outline 1 Background Definition
More informationMotivation. Parametric Curves (later Surfaces) Outline. Tangents, Normals, Binormals. Arclength. Advanced Computer Graphics (Fall 2010)
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 19: Basic Geometric Concepts and Rotations Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs283/fa10 Motivation Moving from rendering to simulation,
More informationJustin Solomon MIT, Spring Numerical Geometry of Nonrigid Shapes
Justin Solomon MIT, Spring 2017 Numerical Geometry of Nonrigid Shapes Intrinsically far Extrinsically close Geodesic distance [jee-uh-des-ik dis-tuh-ns]: Length of the shortest path, constrained not to
More informationSurface 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 informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationTeichmüller Space and Fenchel-Nielsen Coordinates
Teichmüller Space and Fenchel-Nielsen Coordinates Nathan Lopez November 30, 2015 Abstract Here we give an overview of Teichmüller space and its realization as a smooth manifold through Fenchel- Nielsen
More informationDef 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 informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationMathematical Research Letters 1, (1994) MÖBIUS CONE STRUCTURES ON 3-DIMENSIONAL MANIFOLDS. Feng Luo
Mathematical Research Letters 1, 257 261 (1994) MÖBIUS CONE STRUCTURES ON 3-DIMENSIONAL MANIFOLDS Feng Luo Abstract. We show that for any given angle α (0, 2π), any closed 3- manifold has a Möbius cone
More informationOptimal Möbius Transformation for Information Visualization and Meshing
Optimal Möbius Transformation for Information Visualization and Meshing Marshall Bern Xerox Palo Alto Research Ctr. David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science
More informationNotes on Spherical Geometry
Notes on Spherical Geometry Abhijit Champanerkar College of Staten Island & The Graduate Center, CUNY Spring 2018 1. Vectors and planes in R 3 To review vector, dot and cross products, lines and planes
More informationMeasuring Lengths The First Fundamental Form
Differential Geometry Lia Vas Measuring Lengths The First Fundamental Form Patching up the Coordinate Patches. Recall that a proper coordinate patch of a surface is given by parametric equations x = (x(u,
More informationThe topology of limits of embedded minimal disks. (joint work with Jacob Bernstein) Giuseppe Tinaglia King s College London
The topology of limits of embedded minimal disks. (joint work with Jacob Bernstein) Giuseppe Tinaglia King s College London Notations; Background; Main result; Possible questions; Another proof. Let M
More informationTHE HALF-EDGE DATA STRUCTURE MODELING AND ANIMATION
THE HALF-EDGE DATA STRUCTURE MODELING AND ANIMATION Dan Englesson danen344@student.liu.se Sunday 12th April, 2011 Abstract In this lab assignment which was done in the course TNM079, Modeling and animation,
More informationSubdivision overview
Subdivision overview CS4620 Lecture 16 2018 Steve Marschner 1 Introduction: corner cutting Piecewise linear curve too jagged for you? Lop off the corners! results in a curve with twice as many corners
More information3D 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 informationSubdivision. Outline. Key Questions. Subdivision Surfaces. Advanced Computer Graphics (Spring 2013) Video: Geri s Game (outside link)
Advanced Computer Graphics (Spring 03) CS 83, Lecture 7: Subdivision Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs83/sp3 Slides courtesy of Szymon Rusinkiewicz, James O Brien with material from Denis
More informationGreedy Routing with Guaranteed Delivery Using Ricci Flow
Greedy Routing with Guaranteed Delivery Using Ricci Flow Jie Gao Stony Brook University Joint work with Rik Sarkar, Xiaotian Yin, Wei Zeng, Feng Luo, Xianfeng David Gu Greedy Routing Assign coordinatesto
More informationParameterization II Some slides from the Mesh Parameterization Course from Siggraph Asia
Parameterization II Some slides from the Mesh Parameterization Course from Siggraph Asia 2008 1 Non-Convex Non Convex Boundary Convex boundary creates significant distortion Free boundary is better 2 Fixed
More informationGaussian and Mean Curvature Planar points: Zero Gaussian curvature and zero mean curvature Tangent plane intersects surface at infinity points Gauss C
Outline Shape Analysis Basics COS 526, Fall 21 Curvature PCA Distance Features Some slides from Rusinkiewicz Curvature Curvature Curvature κof a curve is reciprocal of radius of circle that best approximates
More informationGeometric structures on 2-orbifolds
Geometric structures on 2-orbifolds Section 1: Manifolds and differentiable structures S. Choi Department of Mathematical Science KAIST, Daejeon, South Korea 2010 Fall, Lectures at KAIST S. Choi (KAIST)
More informationGeometric 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 informationInvariant Measures of Convex Sets. Eitan Grinspun, Columbia University Peter Schröder, Caltech
Invariant Measures of Convex Sets Eitan Grinspun, Columbia University Peter Schröder, Caltech What will we measure? Subject to be measured, S an object living in n-dim space convex, compact subset of R
More informationGEOMETRY OF SURFACES. b3 course Nigel Hitchin
GEOMETRY OF SURFACES b3 course 2004 Nigel Hitchin hitchin@maths.ox.ac.uk 1 1 Introduction This is a course on surfaces. Your mental image of a surface should be something like this: or this However we
More informationFast marching methods
1 Fast marching methods Lecture 3 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Metric discretization 2 Approach I:
More information3D 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 informationLet be a function. We say, is a plane curve given by the. Let a curve be given by function where is differentiable with continuous.
Module 8 : Applications of Integration - II Lecture 22 : Arc Length of a Plane Curve [Section 221] Objectives In this section you will learn the following : How to find the length of a plane curve 221
More informationDiscrete Differential Geometry. Differential Geometry
Discrete Differential Geometry Yiying Tong CSE 891 Sect 004 Differential Geometry Why do we care? theory: special surfaces minimal, CMC, integrable, etc. computation: simulation/processing Grape (u. of
More informationWWW links for Mathematics 138A notes
WWW links for Mathematics 138A notes General statements about the use of Internet resources appear in the document listed below. We shall give separate lists of links for each of the relevant files in
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationComputational Geometry
Lecture 12: Lecture 12: Motivation: Terrains by interpolation To build a model of the terrain surface, we can start with a number of sample points where we know the height. Lecture 12: Motivation: Terrains
More informationBackground for Surface Integration
Background for urface Integration 1 urface Integrals We have seen in previous work how to define and compute line integrals in R 2. You should remember the basic surface integrals that we will need to
More informationGeometry of Flat Surfaces
Geometry of Flat Surfaces Marcelo iana IMPA - Rio de Janeiro Xi an Jiaotong University 2005 Geometry of Flat Surfaces p.1/43 Some (non-flat) surfaces Sphere (g = 0) Torus (g = 1) Bitorus (g = 2) Geometry
More informationTHE GEOMETRIC HEAT EQUATION AND SURFACE FAIRING
THE GEOMETRIC HEAT EQUATION AN SURFACE FAIRING ANREW WILLIS BROWN UNIVERSITY, IVISION OF ENGINEERING, PROVIENCE, RI 02912, USA 1. INTROUCTION This paper concentrates on analysis and discussion of the heat
More informationSpider: A robust curvature estimator for noisy, irregular meshes
Spider: A robust curvature estimator for noisy, irregular meshes Technical report CSRG-531, Dynamic Graphics Project, Department of Computer Science, University of Toronto, c September 2005 Patricio Simari
More informationTutorial 4. Differential Geometry I - Curves
23686 Numerical Geometry of Images Tutorial 4 Differential Geometry I - Curves Anastasia Dubrovina c 22 / 2 Anastasia Dubrovina CS 23686 - Tutorial 4 - Differential Geometry I - Curves Differential Geometry
More informationInversive Plane Geometry
Inversive Plane Geometry An inversive plane is a geometry with three undefined notions: points, circles, and an incidence relation between points and circles, satisfying the following three axioms: (I.1)
More informationCOMPUTING SURFACE UNIFORMIZATION USING DISCRETE BELTRAMI FLOW
COMPUTING SURFACE UNIFORMIZATION USING DISCRETE BELTRAMI FLOW Abstract. In this paper, we propose a novel algorithm for computing surface uniformization for surfaces with arbitrary topology. According
More informationSaab. Kyle McDonald. Polygon Meshes
Saab Kyle McDonald Polygon Meshes Siddhartha Chaudhuri http://www.cse.iitb.ac.in/~cs749 What is a polygon mesh? Like a point cloud, it is a discrete sampling of a surface... but, it adds linear (flat)
More informationBands: A Physical Data Structure to Represent Both Orientable and Non-Orientable 2-Manifold Meshes
Bands: A Physical Data Structure to Represent Both Orientable and Non-Orientable 2-Manifold Meshes Abstract This paper presents a physical data structure to represent both orientable and non-orientable
More informationParameterization of Triangular Meshes with Virtual Boundaries
Parameterization of Triangular Meshes with Virtual Boundaries Yunjin Lee 1;Λ Hyoung Seok Kim 2;y Seungyong Lee 1;z 1 Department of Computer Science and Engineering Pohang University of Science and Technology
More informationTangent & normal vectors The arc-length parameterization of a 2D curve The curvature of a 2D curve
Local Analysis of 2D Curve Patches Topic 4.2: Local analysis of 2D curve patches Representing 2D image curves Estimating differential properties of 2D curves Tangent & normal vectors The arc-length parameterization
More informationSubdivision Surfaces
Subdivision Surfaces 1 Geometric Modeling Sometimes need more than polygon meshes Smooth surfaces Traditional geometric modeling used NURBS Non uniform rational B-Spline Demo 2 Problems with NURBS A single
More informationIntro to Modeling Modeling in 3D
Intro to Modeling Modeling in 3D Polygon sets can approximate more complex shapes as discretized surfaces 2 1 2 3 Curve surfaces in 3D Sphere, ellipsoids, etc Curved Surfaces Modeling in 3D ) ( 2 2 2 2
More informationGeometric 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 informationTriangle meshes I. CS 4620 Lecture Kavita Bala (with previous instructor Marschner) Cornell CS4620 Fall 2015 Lecture 2
Triangle meshes I CS 4620 Lecture 2 1 Shape http://fc00.deviantart.net/fs70/f/2014/220/5/3/audi_r8_render_by_smiska333-d7u9pjt.jpg spheres Andrzej Barabasz approximate sphere Rineau & Yvinec CGAL manual
More informationReal-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 informationLower Bounds on Mean Curvature of Closed Curves Contained in Convex Boundaries
Lower Bounds on Mean Curvature of Closed Curves Contained in Convex Boundaries Greg McNulty, Robert King, Haijian Lin, Sarah Mall August 13, 24 Abstract We investigate a geometric inequality that states
More information