Collars and intestines: Practical conforming delaunay refinement

Proceedings of the 18th International Meshing Roundtable, IMR 2009

Volumn , Issue , 2009, Pages 481-497

  Rand, Alexander ^a   Walkington, Noel ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAUNAY; DELAUNAY REFINEMENTS; PIECEWISE LINEAR;

PIECEWISE LINEAR TECHNIQUES; THREE DIMENSIONAL COMPUTER GRAPHICS;

ALGORITHMS;

EID: 80755132354     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-642-04319-2_28     Document Type: Conference Paper

References (19)

1. Boivin, C., Ollivier-Gooch, C.: Guaranteed-quality triangular mesh generation for domains with curved boundaries. International Journal for Numerical Methods in Engineering 55(10), 1185-1213 (2002)
2. Cardoze, D.E., Miller, G.L., Olah, M., Phillips, T.: A Bezier-based moving mesh framework for simulation with elastic membranes. In: Proceedings of the 13th International Meshing Roundtable, pp. 71-80 (2004)
3. Cheng, S.-W., Dey, T.K., Levine, J.A.: A practical Delaunay meshing algorithm for a large class of domains. In: Proceedings of the 16th International Meshing Roundtable, pp. 477-494 (2007)
4. Cheng, S.-W., Dey, T.K., Ramos, E.A.: Delaunay refinement for piecewise smooth complexes. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1096-1105 (2007)
5. Cheng, S.-W., Poon, S.-H.: Three-dimensional Delaunay mesh generation. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 295-304 (2003)
6. Cohen-Steiner, D., de Verdière, E.C., Yvinec, M.: Conforming Delaunay triangulations in 3D. Computational Geometry: Theory and Applications 28(2-3), 217-233 (2004)
7. Hudson, B.: Safe Steiner points for delaunay refinement. In: Research Notes of the 17th International Meshing Roundtable (2008)
8. Miller, G.L., Pav, S.E., Walkington, N.J.: When and why Ruppert's algorithm works. In: Proceedings of the 12th International Meshing Roundtable, pp. 91-102 (2003)
9. Miller, G.L., Phillips, T., Sheehy, D.: Fast sizing calculations for meshing. In: 18th Fall Workshop on Computational Geometry (2008)
10. Murphy, M., Mount, D.M., Gable, C.W.: A point-placement strategy for conforming Delaunay tetrahedralization. International Journal of Computational Geometry and Applications 11(6), 669-682 (2001)
11. Pav, S.E., Walkington, N.J.: Robust three dimensional Delaunay refinement. In: Proceedings of the 13th International Meshing Roundtable, pp. 145-156 (2004)
12. Pav, S.E., Walkington, N.J.: Delaunay refinement by corner lopping. In: Proceedings of the 14th International Meshing Roundtable, pp. 165-181 (2005)
13. Rand, A., Walkington, N.: 3D Delaunay refinement of sharp domains without a local feature size oracle. In: Proceedings of the 17th International Meshing Roundtable, Pittsburgh, PA (2008)
14. Rand, A., Walkington, N.: Delaunay refinement algorithms for estimating local feature size (submitted, 2009)
15. Rineau, L., Yvinec, M.: Meshing 3D domains bounded by piecewise smooth surfaces. In: Proceedings of the 16th International Meshing Roundtable, pp. 443-460 (2007)
16. Ruppert, J.: A Delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms 18(3), 548-585 (1995)
17. Shewchuk, J.R.: Mesh generation for domains with small angles. In: Proceedings of the 16th Annual Symposium on Computational Geometry, pp. 1-10 (2000)
18. Si, H.: On refinement of constrained Delaunay tetrahedralizations. In: Proceedings of the 15th International Meshing Roundtable, pp. 510-528 (2006)
19. Si, H., Gartner, K.: Meshing piecewise linear complexes by constrained Delaunay tetra-hedralizations. In: Proceedings of the 14th International Meshing Roundtable, pp. 147-163 (2005)