Summary
A practical incremental refinement algorithm for computing a quality, conforming Delaunay mesh of an arbitrary 3D piecewise linear complex is given. The algorithm allows small input angles and does not require the local feature size of the input to be computed before performing the refinement. Small input angles are protected with a new type of collar which is simpler to implement and analyze than previous approaches. The algorithm has been implemented and several computational examples are given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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 (October 2007)
Cheng, S.-W., Poon, S.-H.: Three-dimensional Delaunay mesh generation. Discrete Comput. Geom. 36(3), 419–456 (2006)
Cohen-Steiner, D., de Verdière, E.C., Yvinec, M.: Conforming Delaunay triangulations in 3D. Comput. Geom. Theory Appl. 28(2-3), 217–233 (2004)
Miller, G.L., Pav, S.E., Walkington, N.J.: An incremental Delaunay meshing algorithm. Technical Report 02-CNA-023, Center for Nonlinear Analysis, Carnegie Mellon University, Pittsburgh, Pennsylvania (2002)
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 (September 2003)
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)
Pav, S.E., Walkington, N.J.: Robust three dimensional Delaunay refinement. In: Proceedings of the 13th International Meshing Roundtable (September 2004)
Pav, S.E., Walkington, N.J.: Delaunay refinement by corner lopping. In: Proceedings of the 14th International Meshing Roundtable (September 2005)
Ruppert, J.: A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms 18(3), 548–585 (1995)
Shewchuk, J.R.: Mesh generation for domains with small angles. In: Symposium on Computational Geometry, pp. 1–10 (2000)
Si, H.: On refinement of constrained Delaunay tetrahedralizations. In: Proceedings of the 15th International Meshing Roundtable (September 2006)
Si, H., Gartner, K.: Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. In: Proceedings of the 14th International Meshing Roundtable (September 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rand, A., Walkington, N. (2008). 3D Delaunay Refinement of Sharp Domains without a Local Feature Size Oracle. In: Garimella, R.V. (eds) Proceedings of the 17th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87921-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-87921-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87920-6
Online ISBN: 978-3-540-87921-3
eBook Packages: EngineeringEngineering (R0)