23
Sample Shuffling for Quality Hierarchic Surface Meshing

Sample Shuffling for Quality Hierarchic Surface Meshing

Embed Size (px)

Citation preview

Page 1: Sample Shuffling for Quality Hierarchic Surface Meshing

Sample Shuffling for Quality Hierarchic Surface Meshing

Page 2: Sample Shuffling for Quality Hierarchic Surface Meshing

Surface Meshing

Page 3: Sample Shuffling for Quality Hierarchic Surface Meshing

Sample Decimation

Page 4: Sample Shuffling for Quality Hierarchic Surface Meshing

Surface Reconstruction

Page 5: Sample Shuffling for Quality Hierarchic Surface Meshing

Foot data

No decimation

Page 6: Sample Shuffling for Quality Hierarchic Surface Meshing

• Medial axis

• Local feature size f(p)

• -sampling

• d(p)/f(p)

Local feature size and samplingAmenta-Bern-Eppstein

Page 7: Sample Shuffling for Quality Hierarchic Surface Meshing

Reconstruction

• Functional approach• Tangent plane [HDeDDMS92]

• Natural Neighbors [BC00]

• Voronoi/Delaunay filtering

• Alpha shapes [EM94]• Crust [AB98]

• Cocone [ACDL00]

Page 8: Sample Shuffling for Quality Hierarchic Surface Meshing

Cocones

• Compute cocones

• Filter triangles whose duals intersect cocones

• Extract manifold

Space spanned by vectors making angle /8 with horizontal

Page 9: Sample Shuffling for Quality Hierarchic Surface Meshing

Approximating density• Need an approximation to Restricted Voronoi on S

• Need an approximation to local feature sizes

Page 10: Sample Shuffling for Quality Hierarchic Surface Meshing

Radius and height

• radius r(p): distance from p to pº.

• height h(p): min distance to the poles

• C(p,space spanned by vectors making angles <= with horizontal.

• pº : point at max distance from p

Page 11: Sample Shuffling for Quality Hierarchic Surface Meshing

Deletion and Insertion

• Vertex p is deleted if there is nearby sample point

p)/h(p) < '.

• Insert p° if deletion of p destroys density

r(p)/h(p) >

Page 12: Sample Shuffling for Quality Hierarchic Surface Meshing

Shuffling

Page 13: Sample Shuffling for Quality Hierarchic Surface Meshing

Reconstruction (Dey-Giesen)

Cocone(P,

Compute VP;

for each pP

if pB compute T of triangles with

duals intersecting C(p endif

endfor; Extract manifold;

end

B:= Boundary(P)

Page 14: Sample Shuffling for Quality Hierarchic Surface Meshing

Main Theorem

Theorem 1: For sufficiently small an sample P of S can be shuffled to Q s.t. a surface mesh M can be computed from Q with

• M is homeomorphic to S

• |M-S| = O(f(p) for some p on S

• each triangle has aspect ratio O(

Page 15: Sample Shuffling for Quality Hierarchic Surface Meshing

Synthetic data (Parbol)

No decimation,

8K pts

pts

pts

Page 16: Sample Shuffling for Quality Hierarchic Surface Meshing

Synthetic data (Hyperbol)

No decimation,

8K pts

Page 17: Sample Shuffling for Quality Hierarchic Surface Meshing

Synthetic data (Parcyl)

No decimation,

6K pts

1K pts

0.7K pts

Page 18: Sample Shuffling for Quality Hierarchic Surface Meshing

Experimental Data

Page 19: Sample Shuffling for Quality Hierarchic Surface Meshing

Rocker data

No decimation,

40K pts

pts

pts

Page 20: Sample Shuffling for Quality Hierarchic Surface Meshing

Rocker data

pts

pts

Page 21: Sample Shuffling for Quality Hierarchic Surface Meshing

Experimental data

Page 22: Sample Shuffling for Quality Hierarchic Surface Meshing

Hip data

No decim,

265k pts

pts

pts

126K pts

pts

Page 23: Sample Shuffling for Quality Hierarchic Surface Meshing

Conclusions

• Introduced sample shuffling

• Achieves sample decimation retaining features

• Achieves quality meshing

• What about both coarsening and refining?

• How to take care of the boundaries?

• How to take care of noise?

• Softwares:

www.cis.ohio-state.edu/~tamaldey/cocone.html