Invariant Measures. The Smooth Approach

Similar documents
Invariant Measures of Convex Sets. Eitan Grinspun, Columbia University Peter Schröder, Caltech

Shape Modeling and Geometry Processing

05 - Surfaces. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Daniele Panozzo

Week 7 Convex Hulls in 3D

Introduction to geometry

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.

04 - Normal Estimation, Curves

Surfaces: notes on Geometry & Topology

Euler s Theorem. Brett Chenoweth. February 26, 2013

Solid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO

Geometric Modeling Mortenson Chapter 11. Complex Model Construction

Geometric structures on 2-orbifolds

Euler Characteristic

Chapter 4 Concepts from Geometry

Contents. Preface... VII. Part I Classical Topics Revisited

MATH 890 HOMEWORK 2 DAVID MEREDITH

However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).

Euler Characteristic

1 Appendix to notes 2, on Hyperbolic geometry:

Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary?

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Basics of Combinatorial Topology

Edge unfolding Cut sets Source foldouts Proof and algorithm Complexity issues Aleksandrov unfolding? Unfolding polyhedra.

Geometry Processing TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAA

1 Euler characteristics

Finitely additive measures on o-minimal sets

Some Open Problems in Graph Theory and Computational Geometry

66 III Complexes. R p (r) }.

Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions

1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.

CS 2336 Discrete Mathematics

(a) (b) (c) (d) (e) (f) Figure 3.1: What is a polygon?

Restricted-Orientation Convexity in Higher-Dimensional Spaces

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES

Final Exam, F11PE Solutions, Topology, Autumn 2011

MA 323 Geometric Modelling Course Notes: Day 36 Subdivision Surfaces

Wait-Free Computability for General Tasks

Geometric structures on manifolds

What is Set? Set Theory. Notation. Venn Diagram

Convex Sets. CSCI5254: Convex Optimization & Its Applications. subspaces, affine sets, and convex sets. operations that preserve convexity

Planarity. 1 Introduction. 2 Topological Results

Lecture-12: Closed Sets

COMP331/557. Chapter 2: The Geometry of Linear Programming. (Bertsimas & Tsitsiklis, Chapter 2)

Convex Hulls (3D) O Rourke, Chapter 4

Convexity: an introduction

Simplicial Complexes: Second Lecture

Convex sets and convex functions

(Discrete) Differential Geometry

Collision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering

Lectures on topology. S. K. Lando

Given four lines in space, how many lines meet all four?: The geometry, topology, and combinatorics of the Grassmannian

Algebraic Geometry of Segmentation and Tracking

Topology - I. Michael Shulman WOMP 2004

Matching and Planarity

Question. Why is the third shape not convex?

Lectures in Discrete Differential Geometry 3 Discrete Surfaces

Figure 2.1: An example of a convex set and a nonconvex one.

Discrete Differential Geometry: An Applied Introduction

What is Geometry Processing? Understanding the math of 3D shape and applying that math to discrete shape

DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017

Polytopes Course Notes

CLASSIFICATION OF ORDERABLE AND DEFORMABLE COMPACT COXETER POLYHEDRA IN HYPERBOLIC SPACE

Part IV. 2D Clipping

Lecture 1 Discrete Geometric Structures

Multi-tiling and equidecomposability of polytopes by lattice translates

ACTUALLY DOING IT : an Introduction to Polyhedral Computation

Lecture 5: Simplicial Complex

Lecture 3: Convex sets

References. Additional lecture notes for 2/18/02.

TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.

Convex sets and convex functions

Curvature Berkeley Math Circle January 08, 2013

Math 311. Polyhedra Name: A Candel CSUN Math

Geometric structures on manifolds

TWO CONTRIBUTIONS OF EULER

2. Convex sets. x 1. x 2. affine set: contains the line through any two distinct points in the set

Example: The following is an example of a polyhedron. Fill the blanks with the appropriate answer. Vertices:

Jordan Curves. A curve is a subset of IR 2 of the form

Convex Optimization - Chapter 1-2. Xiangru Lian August 28, 2015

Convex Optimization. Convex Sets. ENSAE: Optimisation 1/24

Discrete Exterior Calculus How to Turn Your Mesh into a Computational Structure. Discrete Differential Geometry

CS675: Convex and Combinatorial Optimization Spring 2018 Convex Sets. Instructor: Shaddin Dughmi

Linear Complexity Hexahedral Mesh Generation

GEOMETRY OF SURFACES. b3 course Nigel Hitchin

T. Background material: Topology

Lecture 15: The subspace topology, Closed sets

Dirichlet Voronoi Diagrams and Delaunay Triangulations

9.5 Equivalence Relations

The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )

Lecture notes for Topology MMA100

Overview. Applications of DEC: Fluid Mechanics and Meshing. Fluid Models (I) Part I. Computational Fluids with DEC. Fluid Models (II) Fluid Models (I)

The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )

4.2 Simplicial Homology Groups

Definition A metric space is proper if all closed balls are compact. The length pseudo metric of a metric space X is given by.

Ma/CS 6b Class 9: Euler s Formula

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

Surface Mesh Generation

Lecture 0: Reivew of some basic material

GAUSS-BONNET FOR DISCRETE SURFACES

GEOMETRIC TOOLS FOR COMPUTER GRAPHICS

Transcription:

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 we can do better! In fact This is our whole goal 2

What Will We Measure? Convex sets in n-space an object living in n-dim space convex, compact subset of e.g., points, edges, faces 3 What Will We Measure? Convex sets in n-space an object living in n-dim space convex, compact subset of + finite unions and intersections e.g., points, edges, faces or entire mesh 4

Starting from Scratch Want to measure things what is a measure? R n convex, compact sets finite unions and intersections provided this expression axioms: (2) additivity makes sense 5 Geometric Measures More axioms (3) Euclidean motion invariant (4) normalization (parallelotope) example: volume Don t want dependence on coordinate origin or orientation Are there others? How do we extend them? 6

Other Measures Elementary symmetric functions area/2 length/4 7 Invariant Measures Intrinsic volumes n measures in n dimensions how to generalize to compact, convex sets? Geometric probability ex: measure points in set probability of hitting set! Volume, area, mean width?! 8

Geometric Probability Blindly throw darts & count number of hits Darts: k-dim subspaces of n-d points lines planes volumes k=0 n=2 9 Geometric Probability Indicator function, input: a dart output (point dart): 1 if dart hits body 0 if dart misses body k=0 n=2 0 0 1 0 1 1 0 0 0 0 10

Geometric Probability Indicator function, input: a dart 0 1 2 output (point dart): 1 if dart hits body 0 0 if dart misses body 0 1 in general, 1 k=1 output is k=0 1 n=2 0 # of hits n=2 0 0 0 0 11 Geometric Probability Throw N random darts to estimate volume R C k=0 n=2 12

Geometric Probability Throw N random darts to estimate volume Throw all the darts you have 13 Geometric Probability Throw N random darts to estimate volume 14

Grassmannian k-dim subspaces of n-d not nec y through origin example: lines in R 3 disjoint union of planar regions measure of lines through rectangle 15 Grassmannian k-dim subspaces of n-d not nec y through origin example: lines in R 3 measure of lines through rectangle number of times meets D 16

Grassmannian k-dim subspaces of n-d not nec y through origin example: lines in R 3 measure of lines through rectangle limit it process gives surface area 17 Example: Lines in R 3 Measure of lines thru planar surface limit process gives surface area for arbitrary planar surface 18

Example: Lines in R 3 Measure of lines through planar surface limit process gives surface area for arbitrary planar surface 19 Example: Lines in R 3 Measure of lines through planar surface limit process gives surface area for arbitrary planar surface 20

Example: Lines in R 3 Area of (non-planar disjoint) surface D partition into planar regions, C i disjoint union 21 Example: Lines in R 3 Area of (non-planar disjoint) surface D surface D partition into planar regions, C i add areas of each region number of times meets D 22

Example: Lines in R 3 Area of (non-planar, disjoint) surface D partition into planar regions, C i add areas of each region 0 1 2 number of times meets D 23 Example: Planes in R 3 Measure planes along a curve: simplest curve: line segment proportional to length 24

Example: Planes in R 3 Measure planes along a curve: simplest curve: line segment proportional to length 25 Example: planes in R 3 Measure planes along a curve: consider polyline proportional to length 26

Mean Width Measure of planes along line for a curve just the length back to the parallelotope planes u mt. P iff mt. c now average over u generally: 27 Recap Axioms it is a measure Euclidian motion invariance additivity some normalization k (C) for compact convex set is the Grassmannian measure of all linear varieties of dim. n-k meeting C 28

But wait Do we have all of them? there is one missing symmetric function of order zero extend to all convex sets indicator function Check that this is indeed a measure limit from the right 29 Going to Higher-D Peel off dimension at a time restriction to hyperplane for finite connected(!) union of convex compact sets Euler characteristic! 30

Going to Higher-D Peel off dimension at a time restriction to hyperplane for finite connected(!) union of convex compact sets Euler characteristic! 31 Euler Character For a polyhedron assume simplicial complex All others follow 32

Continuity Our final axiom measure should be continuous Hadwiger (1957) these measures form a basis for all continuous additive rigid id motion invariant measures on ring of convex sets 33 Putting it Together Through inflated convex regions convex sets in R n min distance to set 34

Example in 2D Inflate a planar polygon by epsilon what is the new area? 35 Example in 2D Inflate a planar polygon by epsilon what is the new area? what is the new area? 36

Example in 2D Inflate a planar polygon by epsilon what is the new area? 37 Example in 3D Inflate a polyhedron this time 38

Example in 3D Inflate a polyhedron this time 39 Example in 3D Inflate a polyhedron this time 40

Example in 3D Inflate a polyhedron this time 41 Putting it Together Steiner, Cauchy, Hadwiger convex sets in R n min distance to set Quermaßintegrale Intrinsic Volumes unit ball 42

Steiner Example in R 3 if K is C 2 normalized elementary symmetric functions in principal curvatures 43 Proof Steiner by induction and with use of the Cauchy formula Smooth case tedious but elementary calculation 44

How to Use? Want to measure deformation? only very few measures need apply volume, area, mean width, Define curvatures of polyhedra? deal with convexity issue Normal cycle Cohen-Steiner/Morvan 45