weizmann institute of science - geometry...

49
Discrete Mappings Yaron Lipman Weizmann Institute of Science 1 2018 AMS short course Discrete Differential Geometry

Upload: others

Post on 13-Jul-2020

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

DiscreteMappings

Yaron Lipman

WeizmannInstituteofScience

12018AMSshortcourse

DiscreteDifferentialGeometry

Page 2: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Surfacesastriangulations

2

• Trianglesstitchedtobuildasurface.

Page 3: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Surfacesastriangulations

3

• Trianglesstitchedtobuildasurface.

• ! = ($, &, ');• $ = )* , & = +*, , ' = -*,. .

Page 4: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Surfacesastriangulations

4

• ! = ($, &, ')

• Rulesforstitchingtriangles:

1. ! isasimplicialcomplex.

2. link )* =∪ 789:∈<+,. isasimpleclosedpolygon.

Page 5: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Surfacesastriangulations

5

• Definition. Asurfacetriangulation isatriplet! = ($, &, ') satisfyingthestitchingrules.

• Forsurfacetriangulationwithboundary,replacestitchingrule2with

2.link()*) isasimple(closedornot)polygon.

Page 6: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Surfacesastriangulations

6

• Theboundaryofsurfacetriangulationisa1Dsimplicialcomplex!= = ($=, &=).

• Theinteriorverticesaredenote$> = $ ∖ $=.

• Definition.! = ($, &, ') isconnectedifitisconnectedasagraph($, &).Itis@-connectedifitcannotbedisconnectedbyremoving@ − 1 vertices.

Page 7: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Surfacesastriangulations

7

• Lemma[Floater’03].If! = ($, &, ') is3-connectedthenanyinteriorvertexcanbeconnectedtoanyothervertex(includingboundary)withaninteriorpath.

Page 8: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Discretemappings

8

• Definition. Asimplicialmap-:! → ℝE istheuniquepiecewise-linearextensionof

avertexmap-F: $ → ℝE.

• WhenG = 1 wecall- asimplicialfunction.

H =IJ*)*

*

↦ - H =IJ*N*

*

J* ≥ 0,IJ*

*

= 1

H-(H)

)*

N*

Page 9: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Thediscretemappingproblem

9

• Problem. Giventwotopologicallyequivalentsurfacetriangulations!Q,!R anda

setofcorrespondinglandmarks H*, S* *∈> ⊂ !Q×!R computea“nice”

simplicialhomeomorphism-:!Q → !R.

Page 10: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Thediscretemappingproblem

10

Page 11: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Thediscretemappingproblem

11

• Difficulty. Requiresfindingacommonisomorphiccommontriangulation,a

combinatorialproblem!

• Idea. Considermapping!Q,!R toacanonicaldomainV,

-Q:!Q → V and-R:!R → V andconstruct- as- = -RWQ ∘ -Q.

V

Page 12: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Thediscretemappingproblem

12

• Twoquestions:

• HowtochooseV?

• HowtocomputethesimplicialmapontoV?

V

Page 13: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Convexcombinationmappings

13

• AtechniquetomapasurfacetriangulationtoℝR.

• Definition. GivenaselectionofaweightperedgeY*, > 0,aconvexcombination

mapping -:! → ℝR isasimplicialmapmappingeachinteriorvertex)* ∈ $> toaplanarpointN* ∈ ℝR sothat

∑ Y*, N, − N* = 0�,∈\8 ,

where\* = ] +*, ∈ & .

• Thispropertyiscalledconvexcombinationproperty↔meanvalueproperty.

N*N,

Page 14: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Discretemaximumprinciple

14

• Theconvexcombinationpropertyisadiscreteversionofthemeanvalueproperty

ofhamornic functions.

• Theorem(Discretemaximumprinciple).Letℎ:! → ℝ beaconvexcombination

functionand! a3-connectedsurfacetriangulation.Let)* ∈ $>.Then,Ifℎ* = min

,ℎ, orℎ* = max

,ℎ, thenℎ isconstant.

Inparticularℎ achievesitsextremepointontheboundary.

ℎ*

Page 15: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Convexcombinationmappings

15

• CCMareingeneralnothomeomorphisms,e.g.,theconstantCCM.

• However,withcertainboundaryconditionsandtargetdomainsc CCMare

guaranteedtobehomeomorphic.

• Wewillexploreafamilyofsuchtargetdomains:

ℱ = V

Page 16: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

ℱ forhomeomorphicCCM

16

Page 17: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Firstmembersofℱ17

• V isaconvexpolygonaldomaininℝR.

• Hintfromanalysis:

Theorem[Rado-Kneser-Choquet]:Let-: e → ℝR beahamornic mapwhere

-|gh isahomeomorphismontotheboundaryofaconvexregion.Then,- is

homeomorphism.

-e

Page 18: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

CCMintoconvexpolygonaldomain

18

• Theorem(Tutte,Floater).Let! = ($, &, ') bea3-connectedsurfacetriangulationhomeomorphictoadisk.Let-:! → ℝR beaCCMsuchthat-|ij

isa

homeomorphismtoaconvexpolygonenclosingadomainΩ.Then,-:! → Ω isahomeomorphism.

Page 19: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

ComputingCCM

19

!

∑ Y*, N, − N*�,∈\8 = 0,)* ∈ $>

)*

N*

N* = l*,)* ∈ $=

)*N*

)*

N*

Page 20: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Uniqueness

20

• Proposition. Thereisauniquesolutiontothelinearsystem.

• Proof. Considerasolutiontothehomogeneoussystem:

ConsiderfirstcoordinateH* ofN* = (H*, S*).ThisisaCCFhencesatisfiesdiscretemaximumprinciple.

IfH* ≠ 0 thereisanon-zerovalueattheboundary,contradiction.

∑ Y*, N, − N*�,∈\8 = 0,)* ∈ $>

N* = 0,)* ∈ $=

Page 21: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

?

Othermembersofℱ = V ?

TopologyTargetdomain

21

?

Page 22: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

conesector

open

disk

Euclideanconesurfaces

22

• Definition.acompactsurfaceV isaeuclidean conesurfaceifitisametricspace

locallyisometrictoanopendisk,acone,orasectorandthenumberofcone

pointsisfinite.

Page 23: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Euclideanorbifolds

23

• Asubfamilyofeuclidean conesurfaces.

• Definition. Aeuclidean orbifoldV isasurfacedefinedasthequotientofℝR byasymmetrywallpapergroupn,thatis

V= ℝR/n.

• ThepointofV aretheorbitsofn,thatis N = p(N) p ∈ n .

Page 24: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Euclideanorbifolds

24

Symmetryofthings[Strauss,Burgiel,Conway]

Page 25: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

25

Euclideanorbifolds andtheir

fundamentaldomains

Page 26: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

CCMintoeuclidean orbifolds

26

• Theorem(orbifold Tutte).Let! = ($, &, ') bea3-connectedsurfacetriangulationhomeomorphictooneoftheeuclidean orbifoldsV withq cones.

Letr = {)t} ⊂ $ beasetofq distinctvertices.

Let-:! → V beaCCMsuchthatthe-|v isabijectionbetweenr andthecones

ofV.Then,-:! → Ω isahomeomorphism.

Page 27: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

ComputingCMMintoanorbifold

• First,cut! = ($, &, ') toadisk-typetriangulation!w = $w, &w, 'w .• Second,computeasimplicialmapx:!w → ℝR asfollows.

Page 28: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Computing

CMMinto

anorbifold

28

I Y*, N, − N*

,∈y8

= 0

Nt = lt

I Y*, N, − N*

,∈y8

+ I Y*w,{**w N, − N*w

,∈y8|

= 0

N* − lt = {**w N*w − lt

)t Nt

)*

N*

N*w

{**w

lt

Page 29: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

ComputingCMMintoanorbifold

• Lastly,themap-:! → V isdefinedby- H = [x H ].

Page 30: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

30

Page 31: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Exampleoforbifold CCM

31

Page 32: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Homeomorphism

32

• Wewilloutlinetheideaoftheproof.

• Letx:!w → ℝR bethesolutiontothelinearsystempreviousdescribed.

• Step1.Buildabranchedcover!′′ to! bystitchingcopiesof!′ accordingtothegroupn.Considertheextensionx:!ww → ℝR.

• Step2.Showx:!ww → ℝR doesnotdegenerateandmaintainstheorientationof

at-leastonetriangle.

• Step3.Ifx doesnotdegenerateandmaintainsorientationofatriangle,itwillalso

notdegeneratenorfliporientationofanyneighbortriangle.

• Step4.Ifx:!ww → ℝR maintainsorientationofalltrianglesitisahomeomorphism.

Consequently-:! → V isahomeomorphism.

Page 33: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Homeomorphism

33

• Step1.Buildabranchedcover!′′ to! bystitchingcopiesof!′ accordingtothegroupn.Considertheextensionx:!ww → ℝR.AllverticessatisfytheCCP.

Page 34: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Homeomorphism

34

• Step2.Wewillshowastrongerclaim.Every(generic)pointintheplaneiscovered

byat-leastonepositivelyorientedtriangle.

Page 35: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

35

Page 36: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Homeomorphism

36

• Step3.Ifx doesnotdegenerateandmaintainsorientationofatriangle,itwillalso

notdegeneratenorflipanyneighbortriangle.

Page 37: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Homeomorphism

37

• Step4.Ifx:!ww → ℝR maintainsorientationofalltrianglesitisahomeomorphism.

Consequently-:! → V isahomeomorphism.

• Repeatwindingnumberargumentbutnowweknowthatalltrianglesare

positivelyoriented.

Page 38: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

ComparisonofCCM

38

Page 39: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Variational principle

39

• WhenY*, = Y,* thereexistsavariational form

min12IY*, N, − N*

R�

Ä89

s.t. boundaryconditions

• ThisenergyiscalleddiscreteDirichlet energy,&h(N).

• Apopularchoiceofweightscomesfromaskingthat&h N = ∫ |ã-|�i .

• Theseweightsarecalledcotan weightsandY*, = cot å*, + cot ç*,.

• ThemeshisDelaunay(å*, + ç*, < è) iff Y*, > 0.

Page 40: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Conformality

40

• TheDirichlet energysatisfies:

&h N = &v N + &ê N

where&ê istheareafunctionalsummingpositiveareasoftriangles.

• Theorbifold Tutte theoremimpliesthat&ê N = ë{+ë(V) constant.• Sincethenumberofpointconstraintsmatchesthedegreesoffreedomin

conformalmapwecanask:

Does-:! →V convergetoaconformalmapunderrefinementof!?

• Theorem. ConvergenceiníQ holdsforV atriangleorbifold.If! isDelaunay

uniformconvergencehold.

Page 41: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

41

Page 42: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

42

Page 43: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Discreteuniformization

43

[Springborn etal.08] Orbifold-Tutte

Page 44: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Discretemappingofsurfaces

44

• Backtothediscretemappingproblem:wegotasolutionforup-to4

landmarkconstraints.

• Discreteextremalquasiconformal maps….?

Page 45: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Openproblems

45

• Problem. Canℱ beenlarged?

• Iamnotawareofsuchresult.

• Problem. Canℱ beenlargedunderextraconditions?

• Severalinterestingsuchresults.Seenotes.

Page 46: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Beyondeuclidean

46

• CCMcanbegeneralizedtohyperbolicplane.

• Basicresults(Tutte,Orbifold Tutte)stillholds.• Allowsinfinitenumberofcones.

• Drawback: nolongeralinearmodel

Page 47: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Beyondeuclidean

47

Page 48: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Higherdimensions?

48

• CounterexampletoTutte exists.Thefollowingexampleby[Floater,Pham-Trong].

Page 49: Weizmann Institute of Science - Geometry Collectivegeometry.cs.cmu.edu/...DiscreteMappings.pdfDiscrete maximum principle 14 • The convex combination property is a discrete version

Theend

49

• Funding:• ThisworkwassupportedbytheIsraelScienceFoundation(grantNo.ISF1830/17).

• Thanks:• Courseteammates:Keenan,Max,Justin,andJohannes.

• AMSpeople:Lori,Tom

• You!

• Proofreadingandgoodadvice:• NoamAigerman,Nadav Dym

• Code:• https://github.com/noamaig/euclidean_orbifolds