size competitive meshing without large angles

12 July 2007 Gary MillerOverlay Stitch Meshing

Size Competitive Meshing Size Competitive Meshing without Large Angleswithout Large Angles

Gary L. MillerGary L. MillerCarnegie Mellon Carnegie Mellon

Computer ScienceComputer ScienceJoint work with Todd Joint work with Todd

Phillips and Don SheehyPhillips and Don Sheehy

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

GraphGraph

Output: A Conforming TriangulationOutput: A Conforming Triangulation

GraphGraph

QualityQuality

What is a quality triangle?What is a quality triangle?

No Small AnglesNo Small Angles No Large AnglesNo Large Angles

Implies triangles Implies triangles havehave

bounded bounded aspect aspect ratioratio..

bounded bounded aspect aspect ratioratio..Implies triangles Implies triangles havehave

bounded bounded largest largest anglesangles..

Can be Can be efficientlyefficiently computed by computed by

Delaunay Delaunay RefinementRefinement

Sufficient Sufficient for many for many applications.applications.

Can be asymptotically Can be asymptotically smallersmaller then Delaunay then Delaunay

Refinement Refinement triangulations.triangulations.

Can be asymptotically Can be asymptotically smallersmaller then Delaunay then Delaunay

Refinement Refinement triangulations.triangulations.

More More difficultdifficult to to analyze.analyze.

In Defense of QualityIn Defense of Quality

What went wrong?What went wrong?

Interpolation ProblemInterpolation Problem

No Large AnglesNo Large Angles Large AnglesLarge Angles

Large angles give large HLarge angles give large H11 errors that FEMs try to minimize. errors that FEMs try to minimize.

Paying for the spreadPaying for the spread

Spread = L/sSpread = L/s

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

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

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

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

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

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

Delaunay RefinementDelaunay Refinement

Theorem: Delaunay Refinement on Theorem: Delaunay Refinement on point point setssets terminates and returns a terminates and returns a triangulation with triangulation with

• all angles at least 30-all angles at least 30- degrees degrees

• O(n log L/s) trianglesO(n log L/s) triangles

On Point Sets, we only pay for the log of the spread.On Point Sets, we only pay for the log of the spread.

Paterson’s ExamplePaterson’s ExampleRequires O(nRequires O(n22) points.) points.

O(n) O(n) pointpoint

O(n) O(n) lineline

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

O(n) O(n) lineline

Past ResultsPast Results• O(n) triangles with 90O(n) triangles with 90oo largest angles largest angles

for polygons with holes. for polygons with holes. [Bern, Mitchell, [Bern, Mitchell, Ruppert, 95]Ruppert, 95]

• ((nn22) lower bound for arbitrary ) lower bound for arbitrary PLSGs. PLSGs. [Paterson][Paterson]

• O(nO(n22) triangles with 132) triangles with 132oo angles on angles on PSLGs. PSLGs. [Tan, 96][Tan, 96]

Past ResultsPast ResultsDelaunay Refinement MethodsDelaunay Refinement Methods No-Large-Angle MethodsNo-Large-Angle Methods

ProsPros ProsProsConsCons ConsCons

Good TheoryGood Theory

Optimal Optimal RuntimeRuntime

Graded MeshGraded Mesh

Simple to Simple to ImplementImplement

Esthetically Esthetically NiceNice

Huge Meshes Huge Meshes O(L/s)O(L/s)

Require Hacks to Require Hacks to handle small input handle small input

angles.angles.

Size depends on Size depends on smallest angle.smallest angle.

Smaller MeshesSmaller Meshes

Worst-Case Worst-Case OptimalOptimal

Not well-gradedNot well-graded

Complicated to Complicated to ImplementImplement

angles.angles.

OUROUR

angles.angles.

Only Worst-Case Only Worst-Case BoundsBounds

OUROUR

angles.angles.

Smaller Smaller MeshesMeshes

Worst-Case Worst-Case Optimal sizeOptimal size

OUROUR

Graded on AverageGraded on Average

Log L/s -competitiveLog L/s -competitive

angles.angles.

Smaller Smaller MeshesMeshes

Worst-Case Worst-Case Optimal sizeOptimal size

OUROUR

Graded on AverageGraded on Average

Log L/s -competitiveLog L/s -competitive

Our Angle bounds are not as good, 170Our Angle bounds are not as good, 170oo versus ~140 versus ~140oo

Local Feature SizeLocal Feature Size

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

xxlfs(x)lfs(x)Note: lfs is defined on the whole plane.Note: lfs is defined on the whole plane.

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

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

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

at least 30at least 30oo

Angle GuaranteesAngle Guarantees

We want to prove We want to prove that the stitch that the stitch

vertices that we vertices that we keep do not form keep do not form

bad angles.bad angles.

An Overlay TriangleAn Overlay Triangle

An Overlay EdgeAn Overlay Edge

Gap BallGap Ball

A Good IntersectionA Good Intersection

A Bad IntersectionA Bad Intersection

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

Angle GuaranteesAngle GuaranteesHow Bad can it How Bad can it

be?be?

About 10About 10oo

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

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

Overlay Phase: O(n log L/s) Overlay Phase: O(n log L/s) points addedpoints added

Overlay Phase: O(n log L/s) Overlay Phase: O(n log L/s) pointspoints

Stitching Phase: O(Stitching Phase: O(ssEE lfs lfs00-1-1(z)dz) (z)dz)

Ruppert’s IdeaRuppert’s Idea

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

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

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

Ruppert’s IdeaRuppert’s Idea

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

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

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

CaveatCaveat: Only Works for well-graded meshes : Only Works for well-graded meshes

with bounded with bounded smallestsmallest angle. angle.

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

ExtendingExtending Ruppert’s Idea Ruppert’s Idea

An input edge An input edge e e intersecting intersecting

the overlay meshthe overlay mesh

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)

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 compare these just need to compare these

integrals with optimal.integrals with optimal.

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

Competitive AnalysisCompetitive AnalysisWarm-upWarm-up

9090oo

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

an optimalan optimal

an optimalan optimal Every input edge is Every input edge is covered by empty covered by empty

lenses.lenses.

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 will integrate over to get a lower bound.This is what we will integrate over to get a lower bound.

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.

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.

ee’’

In other words:In other words:

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.

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 simple calculus to bound We used simple calculus to bound

mesh sizes.mesh sizes.

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

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

Where to go from here?Where to go from here?• 3D?3D?• Better angle bounds?Better angle bounds?• Find a constant competitive Find a constant competitive

algorithm.algorithm.

Where to go from here?Where to go from here?• 3D?3D?• Better angle bounds?Better angle bounds?• Find a constant competitive Find a constant competitive

algorithm.algorithm.

ThanksThanks

ee’’

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

ee’’

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

ee’’

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

11stst trick: lfs \ge s everywhere trick: lfs \ge s everywhere

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

ee’’

Parametrize e’ as e’(t) for tParametrize e’ as e’(t) for t22 [0, [0, ll] ] ll = length(e’) = length(e’)

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

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

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

ee’’

Parametrize e’ as Parametrize e’ as e’(t)e’(t)11stst trick: lfs trick: lfs ¸̧ s everywhere s everywhere

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

zz22 e’ e’ 1/lfs(z) dz 1/lfs(z) dz ·· 2 2 ss 00 1/s + 2 1/s + 2 ssll/2/2

1/x dx 1/x dx

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

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

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

size competitive meshing without large angles

spreadols triangles

patersonon2 triangles

quality triangle

o angles

o largest angles

large anglesgary

delaunay refinementsufficient

large h1 errors

Documents

free meshing

meshing techniques

5/2/2007don sheehy overlay stitch meshing 1. 5/2/2007don...

straus7 meshing tutorial

adaptive meshing -...

meshing of a detailed drivaer body with ansys meshing and

meshing in patran

advanced meshing tools page 1 advanced meshing...

meshing: a (biased) crash course - michigan state...

free meshing vs mapped meshing the debate continues…

meshing guide

9. meshing

meshingddg.dreamhosters.com/cs1762014/wp-content/uploads/2014/01/meshi… ·...

volume meshing

cad meshing

meshing help - ceet.niu.edu (1).pdf · ansys workbench and...

meshing gears

surface meshing

meshing application - meshing cad instances...meshing...

meshing methods (ansys meshing) _ everyone is number one