Summary
A number of approaches have been suggested for the selection of the positions of Steiner points in Delaunay mesh refinement. In particular, one can define an entire region (called picking region or selection disk) inside the circumscribed sphere of a poor quality element such that any point can be chosen for insertion from this region. The two main results which accompany most of the point selection schemes, including those based on regions, are the proof of termination of the algorithm and the proof of good gradation of the elements in the final mesh. In this paper we show that in order to satisfy only the termination requirement, one can use larger selection disks and benefit from the additional flexibility in choosing the Steiner points. However, if one needs to keep the theoretical guarantees on good grading then the size of the selection disk needs to be smaller. We introduce two types of selection disks to satisfy each of these two goals and prove the corresponding results on termination and good grading first in two dimensions and then in three dimensions using the radius-edge ratio as a measure of element quality. We call the point placement method semi-generalized because the selection disks are defined only for mesh entities of the highest dimension (triangles in two dimensions and tetrahedra in three dimensions); we plan to extend these ideas to lower-dimensional entities in the future work. We implemented the use of both two- and three-dimensional selection disks into the available Delaunay refinement libraries and present one example (out of many choices) of a point placement method; to the best of our knowledge, this is the first implementation of Delaunay refinement with point insertion at any point of the selection disks (picking regions).
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
A. Bowyer. Computing Dirichlet tesselations. Computer Journal, 24:162–166, 1981.
A. N. Chernikov and N. P. Chrisochoides. Generalized Delaunay mesh refinement: From scalar to parallel. In Proceedings of the 15th International Meshing Roundtable, pages 563–580, Birmingham, AL, Sept. 2006. Springer.
L. P. Chew. Guaranteed quality mesh generation for curved surfaces. In Proceedings of the 9th ACM Symposium on Computational Geometry, pages 274–280, San Diego, CA, 1993.
L. P. Chew. Guaranteed-quality Delaunay meshing in 3D. In Proceedings of the 13th ACM Symposium on Computational Geometry, pages 391–393, Nice, France, 1997.
B. N. Delaunay. Sur la sphere vide. Izvestia Akademia Nauk SSSR, VII Seria, Otdelenie Mataematicheskii i Estestvennyka Nauk, 7:793–800, 1934.
W. H. Frey. Selective refinement: A new strategy for automatic node placement in graded triangular meshes. International Journal for Numerical Methods in Engineering, 24(11):2183–2200, 1987.
P.-L. George and H. Borouchaki. Delaunay Triangulation and Meshing. Application to Finite Elements. HERMES, 1998.
F. Labelle. Sliver removal by lattice refinement. In Proceedings of the 21nd Symposium on Computational Geometry, pages 347–356, New York, NY, USA, 2006. ACM Press.
X.-Y. Li. Generating well-shaped d-dimensional Delaunay meshes. Theoretical Computer Science, 296(1):145–165, 2003.
X.-Y. Li and S.-H. Teng. Generating well-shaped Delaunay meshes in 3D In Proceedings of the 12th annual ACM-SIAM symposium on Discrete algorithms, pages 28–37, Washington, D.C., 2001.
G. L. Miller, D. Talmor, S.-H. Teng, and N. Walkington. A Delaunay based numerical method for three dimensions: Generation, formulation, and partition. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 683–692, Las Vegas, NV, May 1995.
S. A. Mitchell. bta>Cardinality bounds for triangulations with bounded minimum angle. In Proceedings of the 6th Canadian Conference on Computational Geometry, pages 326–331, Saskatoon, Saskatchewan, Canada, Aug. 1994.
I. Pivkin, E. Hueso, R. Weinstein, D. Laidlaw, S. Swartz, and G. Karniadakis. Simulation and visualization of air flow around bat wings during flight. In Proceedings of the International Conference on Computational Science, pages 689–694, Atlanta, GA, 2005.
J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548–585, 1995.
J. R. Shewchuk. Delaunay Refinement Mesh Generation. PhD thesis, Carnegie Mellon University, 1997.
J. R. Shewchuk. Tetrahedral mesh generation by Delaunay refinement. In Proceedings of the 14th ACM Symposium on Computational Geometry, pages 86–95, Minneapolis, MN, 1998.
J. R. Shewchuk. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications, 22(1–3):21–74, May 2002.
H. Si. On refinement of constrained Delaunay tetrahedralizations. In Proceedings of the 15th International Meshing Roundtable, pages 509–528, Birmingham, AL, Sept. 2006. Springer.
H. Si and K. Gaertner. Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. In Proceedings of the 14th International Meshing Roundtable, pages 147–163, San Diego, CA, Sept. 2005. Springer.
A. Üngör. Off-centers: A new type of Steiner points for computing size-optimal guaranteed-quality Delaunay triangulations. In Proceedings of LATIN, pages 152–161, Buenos Aires, Argentina, Apr. 2004.
A. Üngör. Quality triangulations made smaller. In Proceedings of the European Workshop on Computational Geometry, Technische Universiteit Eindhoven, Mar. 2005. Accessed online at http://www.win.tue.nl/EWCG2005/Proceedings/2.pdf on April 28, 2007.
D. F. Watson. Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. Computer Journal, 24:167–172, 1981.
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
Chernikov, A.N., Chrisochoides, N.P. (2008). Three-dimensional Semi-generalized Point Placement Method for Delaunay Mesh Refinement. In: Brewer, M.L., Marcum, D. (eds) Proceedings of the 16th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75103-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-75103-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75102-1
Online ISBN: 978-3-540-75103-8
eBook Packages: EngineeringEngineering (R0)