Localized%20Delaunay%20Refinement%20For%20Piecewise-Smooth%20Complexes - PowerPoint PPT Presentation

About This Presentation
Title:

Localized%20Delaunay%20Refinement%20For%20Piecewise-Smooth%20Complexes

Description:

Localized Delaunay Refinement For Piecewise-Smooth Complexes Andrew G. Slatton Joint work with Tamal K. Dey The Ohio State University Department of Computer Science ... – PowerPoint PPT presentation

Number of Views:89
Avg rating:3.0/5.0
Slides: 18
Provided by: josh2200
Category:

less

Transcript and Presenter's Notes

Title: Localized%20Delaunay%20Refinement%20For%20Piecewise-Smooth%20Complexes


1
Localized Delaunay Refinement For
Piecewise-Smooth Complexes
  • Andrew G. SlattonJoint work with Tamal K. Dey
  • The Ohio State University
  • Department of Computer Science and Engineering

2
The Problem
  • Input Piecewise-smooth complex (PSC) D
  • Output Triangular mesh approximating D
  • Constraint Use localized Delaunay framework
  • Generate many local sub-meshes
  • Ignore mesh structure at global level

(mostly)
3
Delaunay Refinement
  • Large meshes ? Memory thrashing
  • Localized framework avoids this

4
Sharp Features
  • Preserve via
  • Cheng, Dey, Ramos 2008

protecting balls
weighted points
5
Localization Protection
  • Localization Dey, Levine, Slatton 2010
  • Divide sample in octree
  • Refine one node at a time
  • Protection Cheng, Dey, Shewchuk 2012
  • Preserve sharp features via protecting balls
  • Refine protecting balls that are too large



6
Difficulties
  • An assimilation of previous works
  • So wheres the challenge?
  • Is ball refinement local?
  • Yes! this must be proven
  • What is its radius of operation?
  • Max distance at which we insert/delete samples
  • Need this to initialize a local triangulation

7
Node Processing
  • Split
  • When P?gt ?
  • Refine

P?
gathering distance
dg
N?
8
Refinement Criteria
  • Ball connectivity
  • Patch vertices
  • Disk
  • Size

?
9
Point Insertion
  • Inter-point distance LB ? Termination
  • Must avoid arbitrarily close insertions

10
Reprocessing
  • Refining ?
  • Do we affect other local meshes?

dg
11
Ball Refinement
  • Refining b
  • Remove contiguous set of balls containing b
  • Cover exposed segment with smaller balls
  • Remove zero-weighted points inside new balls
  • Radius of operation dg
  • Refining b??, all affected points lie in P?UN?

12
Potential Complications
  • Why is radius of operation important?
  • dg too large increased overhead
  • Too small
  • May preclude lower bound on inter-ball distance
  • May allow zero-weighted points to lie inside a
    ball
  • Would falsify some lemmas leading to termination

13
Local Ball Refinement Theorem
  • Proven by showing radius of operation dg

14
Guarantees
  • Termination
  • Subcomplex of restricted Delaunay Del(P )D
  • Each point in output lies close to D
  • For sufficiently small ?
  • Output homeomorphic to input

15
Results
16
Software Results
http//www.cse.ohio-state.edu/tamaldey/locpsc.htm
l
17
Thank You!
  • Questions?
Write a Comment
User Comments (0)
About PowerShow.com