5/2/2007Don Sheehy Overlay Stitch Meshing 1. 5/2/2007Don Sheehy Overlay Stitch Meshing 2 A competitive algorithm for no-large-angle triangulation Don.

5/2/2007 Don SheehyOverlay Stitch Meshing

1

Overlay Stitch MeshingOverlay Stitch Meshing


2

A competitive algorithm for A competitive algorithm for no-large-angle triangulationno-large-angle triangulation

Don SheehyDon Sheehy

Joint work with Gary Miller Joint work with Gary Miller and Todd Phillipsand Todd Phillips

To appear at ICALP 2007To appear at ICALP 2007


3

The ProblemThe ProblemInput: A Planar Straight Line Input: A Planar Straight Line

GraphGraph


4


GraphGraph

Output: A Conforming TriangulationOutput: A Conforming Triangulation


5


GraphGraph

Output: A Conforming TriangulationOutput: A Conforming Triangulation


6

Why would you want to do that?Why would you want to do that?


7



8



9



10



11



12


13


14


15


16


17


18

What went wrong?What went wrong?


19

What if you don’t know the function?What if you don’t know the function?

?? ??


20

2 Definitions of Quality2 Definitions of Quality

1. No Large Angles [Babuska, Aziz 1. No Large Angles [Babuska, Aziz 1976]1976]


21

2 Definitions of Quality2 Definitions of Quality

1. No Large Angles [Babuska, Aziz 1. No Large Angles [Babuska, Aziz 1976]1976]

2. No Small Angles2. No Small Angles


22

No Small AnglesNo Small Angles


23

No Small AnglesNo Small Angles

You may have heard of these You may have heard of these before.before.

Delaunay RefinementDelaunay Refinement

Sparse Voronoi RefinementSparse Voronoi Refinement

QuadtreeQuadtree


24

Paying for the spreadPaying for the spread


25


LL

ss

Spread = L/sSpread = L/s


26


Optimal No-Large-Angle TriangulationOptimal No-Large-Angle Triangulation


27

Paying for the spreadPaying for the spreadWhat if we don’t allow small angles?What if we don’t allow small angles?


28

Paying for the spreadPaying for the spreadWhat if we don’t allow small angles?What if we don’t allow small angles?


29


O(L/s)O(L/s) triangles! triangles!

What if we don’t allow small angles?What if we don’t allow small angles?


30


O(L/s)O(L/s) triangles! triangles!

What if we don’t allow small angles?What if we don’t allow small angles?Fact: For inputs with Fact: For inputs with NO NO edgesedges, no-small-angle , no-small-angle

meshing algorithms produce meshing algorithms produce output with output with O(n log L/s)O(n log L/s) size size and angles between 30and angles between 30oo and and

120120oo


31

What to do?What to do?


32

What to do?What to do?

Small input angles can force even smaller Small input angles can force even smaller ouput angles. [Shewchuk ’02]ouput angles. [Shewchuk ’02]


33

No Large AnglesNo Large Angles


34

Polygons with HolesPolygons with Holes[Bern, Mitchell, Ruppert 95] – [Bern, Mitchell, Ruppert 95] –

- All triangles are - All triangles are nonobtuse. nonobtuse.

- Output has O(n) triangles.- Output has O(n) triangles.


35

Polygons with HolesPolygons with Holes[Bern, Mitchell, Ruppert 95] – [Bern, Mitchell, Ruppert 95] –

- All triangles are - All triangles are nonobtuse. nonobtuse.

- Output has O(n) triangles.- Output has O(n) triangles.

Does not work for arbitrary PSLGsDoes not work for arbitrary PSLGs


36

Paterson’s ExamplePaterson’s ExampleRequires Requires (n(n22) points.) points.

O(n) O(n) pointpoint

ss

O(n) O(n) lineline

ss


37



ss

O(n) O(n) lineline

ss


38



ss

O(n) O(n) lineline

ss


39



ss

O(n) O(n) lineline

ss


40



ss

O(n) O(n) lineline

ss


41



ss

O(n) O(n) lineline

ss


42

Propagating PathsPropagating Paths


43



44



45



46



47


First introduced by Mitchell [93]First introduced by Mitchell [93]


48



Later Improved by Tan [96]Later Improved by Tan [96]


49



Later Improved by Tan [96]Later Improved by Tan [96]

Worst Case Optimal Size O(nWorst Case Optimal Size O(n22))

Angle bounds: 132Angle bounds: 132oo


50

The OSM AlgorithmThe OSM Algorithm(Overlay Stitch Meshing)(Overlay Stitch Meshing)


51


Results:Results:1.1. Angles bounded by 170Angles bounded by 170oo

2.2. O(log L/s) competitive sizeO(log L/s) competitive size


52



53



54



55



56



57



58



59



60



61



62



63



64


• An Overlay Edge is An Overlay Edge is keptkept if if1. It does not intersect the input,1. It does not intersect the input,

OROR


65



OROR

2. It forms a 2. It forms a goodgood intersection with the intersection with the input.input.


66



OROR

2. It forms a 2. It forms a goodgood intersection with the intersection with the input.input.

at least 30at least 30oo


67

Angle GuaranteesAngle Guarantees


68



69


We want to show that angles at We want to show that angles at stitchstitch vertices are bounded by vertices are bounded by

170170oo


70


An Overlay TriangleAn Overlay Triangle


71



An Overlay EdgeAn Overlay Edge


72



An Overlay EdgeAn Overlay Edge

Gap BallGap Ball


73


A Good IntersectionA Good Intersection


74


A Bad IntersectionA Bad Intersection


75




76




77



How Bad can it How Bad can it be?be?


78

Angle GuaranteesAngle GuaranteesHow Bad can it How Bad can it

be?be?


79


be?be?


80


be?be?

About 10About 10oo


81


be?be?

About 10About 10oo

About 170About 170oo


82


be?be?

About 10About 10oo

Theorem: If any input Theorem: If any input edge makes a edge makes a goodgood intersection with an intersection with an overlay edge then any overlay edge then any other intersection on other intersection on that edge is that edge is not too not too badbad..

About 170About 170oo


83

Size BoundsSize Bounds


84

Size BoundsSize BoundsHow big is the resulting triangulation?How big is the resulting triangulation?


85

Size BoundsSize BoundsHow big is the resulting triangulation?How big is the resulting triangulation?

Goal: log(L/s)-competitive with optimalGoal: log(L/s)-competitive with optimal


86

Local Feature SizeLocal Feature Size

lfs(x) = distance to second nearest input vertex.lfs(x) = distance to second nearest input vertex.

xxlfs(x)lfs(x)

Note: lfs is defined on Note: lfs is defined on the whole plane before the whole plane before

we do any meshing.we do any meshing.


87

Ruppert’s IdeaRuppert’s Idea

rr

cc

r = r = (lfs(c))(lfs(c))

area(area() = ) = (lfs(c)(lfs(c)22))

# of triangles = # of triangles = ((ssss 1/lfs(x,y) 1/lfs(x,y)22 dxdy) dxdy)


88


rr

cc



# of triangles = # of triangles = ((ssss 1/lfs(x,y) 1/lfs(x,y)22 dxdy) dxdy)

dydy

dxdxThis represents a This represents a (dxdy/lfs(x,y)(dxdy/lfs(x,y)22)) fraction of the fraction of the

triangle.triangle.


89


rr

cc



# of triangles = # of triangles = ((ssss lfs(x,y) lfs(x,y)-2-2 dxdy) dxdy)

CaveatCaveat: Only Works for meshes : Only Works for meshes

with bounded with bounded smallestsmallest angle. angle.


90

ExtendingExtending Ruppert’s Idea Ruppert’s Idea# of triangles = # of triangles = ((ssss lfs(x,y) lfs(x,y)-2-2 dxdy) dxdy)


91

ExtendingExtending Ruppert’s Idea Ruppert’s Idea

An input edge An input edge e e intersecting intersecting

the overlay meshthe overlay mesh



92


An input edge An input edge e e intersecting intersecting

the overlay meshthe overlay mesh

# of triangles along # of triangles along ee = = ((sszz22 e e lfs(z) lfs(z)-1-1 dz) dz)



93


Now we can compute the Now we can compute the size of our output mesh. We size of our output mesh. We just need to compute these just need to compute these

integrals.integrals.

# of triangles along # of triangles along ee = = ((sszz22 e e lfs(z) lfs(z)-1-1 dz) dz)



94

Output SizeOutput Size

Stitch Vertices Added = Stitch Vertices Added = ((sszz22 E E lfs(z) lfs(z)-1-1 dz) dz)

Overlay Mesh Size = Overlay Mesh Size = ((ssss lfs(x,y) lfs(x,y)-2-2 dxdy) dxdy)


95



Overlay Mesh Size = Overlay Mesh Size = ((ssss lfs(x,y) lfs(x,y)-2-2 dxdy) dxdy) O(n log L/s)O(n log L/s)

O(log L/s)O(log L/s)££ |OPT| |OPT|


96



Overlay Mesh Size = Overlay Mesh Size = ((ssss lfs(x,y) lfs(x,y)-2-2 dxdy) dxdy) O(n log L/s)O(n log L/s)

O(log L/s)O(log L/s)££ |OPT| |OPT|

We’ll Prove this nowWe’ll Prove this now


97

What can we say about the What can we say about the optimal optimal no-large-angle no-large-angle

triangulation?triangulation?


98

Competitive AnalysisCompetitive AnalysisWarm-upWarm-up


99


9090oo


100


??oo


101



102



103



104



105



106


Suppose we have a triangulation with all angles at least 170Suppose we have a triangulation with all angles at least 170oo..


107



the optimalthe optimal


108



the optimalthe optimal Every input edge is Every input edge is covered by empty covered by empty

lenses.lenses.


109

Competitive AnalysisCompetitive Analysis


the optimalthe optimal Every input edge is Every input edge is covered by empty covered by empty

lenses.lenses.

This is what we have to integrate over.This is what we have to integrate over.


110

Competitive AnalysisCompetitive AnalysisThis is what we have to integrate over.This is what we have to integrate over.

We show that in each lens, we We show that in each lens, we put O(log (L/s)) points on the put O(log (L/s)) points on the

edge.edge.


111

Competitive AnalysisCompetitive AnalysisThis is what we have to integrate over.This is what we have to integrate over.

We show that in each lens, we We show that in each lens, we put O(log (L/s)) points on the put O(log (L/s)) points on the

edge.edge.

In other words:In other words:

sse’e’ 1/lfs(z) dz = O(log (L/s)) 1/lfs(z) dz = O(log (L/s))

ee’’


112


ee’’

sszz22 e’ e’ 1/lfs(z) dz = O(log (L/s)) 1/lfs(z) dz = O(log (L/s))


113


ee’’

Parametrize e’ as [0, Parametrize e’ as [0, ll] where ] where ll = length(e’) = length(e’)



114


ee’’


Parametrize e’ as [0, Parametrize e’ as [0, ll]]

11stst trick: lfs trick: lfs ¸̧ s everywhere s everywhere


115

Competitive AnalysisCompetitive Analysissszz22 e’ e’ 1/lfs(z) dz = O(log (L/s)) 1/lfs(z) dz = O(log (L/s))

ee’’


22ndnd trick: lfs trick: lfs ¸̧ ct for t ct for t22 [0, [0,ll/2]/2]

tt



116

Competitive AnalysisCompetitive Analysissszz22 e’ e’ 1/lfs(z) dz = O(log (L/s)) 1/lfs(z) dz = O(log (L/s))

ee’’


22ndnd trick: lfs trick: lfs ¸̧ ct for ct for tt22 [0, [0,ll/2]/2]

tt

sszz22 e’ e’ 1/lfs(z) dz 1/lfs(z) dz ·· 2 2ss00ss 1/s + 2 1/s + 2ssss

ll/2/2 1/x 1/x dx dx

= O(1) + O(log = O(1) + O(log ll/s)/s)

= O(log L/s)= O(log L/s)



117

ConclusionsConclusions


118

ConclusionConclusion• A new algorithm for no-large-angle A new algorithm for no-large-angle

triangulation.triangulation.• The output has bounded degree The output has bounded degree

triangles.triangles.• The first log-competitive analysis for The first log-competitive analysis for

such an algorithm.such an algorithm.


119

ConclusionConclusion• A new algorithm for no-large-angle A new algorithm for no-large-angle

triangulation.triangulation.• The output has bounded degree The output has bounded degree

triangles.triangles.• The first log-competitive analysis for The first log-competitive analysis for

such an algorithm.such an algorithm.• We used some of the high school We used some of the high school

calculus you thought you forgot.calculus you thought you forgot.


120

Where to go from here?Where to go from here?• 3D?3D?


121

Where to go from here?Where to go from here?• 3D?3D?• Better angle bounds?Better angle bounds?


122

Where to go from here?Where to go from here?• 3D?3D?• Better angle bounds?Better angle bounds?• Leverage lower bound technology for Leverage lower bound technology for

constant competitive algorithm.constant competitive algorithm.


123

Thank you.Thank you.

5/2/2007Don Sheehy Overlay Stitch Meshing 1. 5/2/2007Don Sheehy Overlay Stitch Meshing 2 A competitive algorithm for no-large-angle triangulation Don.

Documents