Summary
Recently a Delaunay refinement algorithm has been proposed that can mesh domains as general as piecewise smooth complexes [7]. This class includes polyhedra, smooth and piecewise smooth surfaces, volumes enclosed by them, and above all non-manifolds. In contrast to previous approaches, the algorithm does not impose any restriction on the input angles. Although this algorithm has a provable guarantee about topology, certain steps are too expensive to make it practical.
In this paper we introduce a novel modification of the algorithm to make it implementable in practice. In particular, we replace four tests of the original algorithm with only a single test that is easy to implement. The algorithm has the following guarantees. The output mesh restricted to each manifold element in the complex is a manifold with proper incidence relations. More importantly, with increasing level of refinement which can be controlled by an input parameter, the output mesh becomes homeomorphic to the input while preserving all input features. Implementation results on a disparate array of input domains are presented to corroborate our claims. %We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions with correct topology. The small angles between %the tangents of two meeting manifold patches pose difficulty. We protect these %regions with weighted points. The weights are chosen to mimic the local feature size and to satisfy a Lipschitz-like property. A Delaunay refinement using the weighted Voronoi diagram is shown to terminate with the recovery of the topology of the input. To this end, we present new concepts and results %including a new definition of local feature size and a proof for a %generalized topological ball property.
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
P. Alliez, G. Ucelli, C. Goldman, and M. Attene. Recent advances in remeshing of surfaces. State-of-the-art report of AIM\@SHAPE EU network, 2007.
N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discr. Comput. Geom., 22 (1999), 481–504.
C. Boivin and C. Ollivier-Gooch. Guaranteed-quality triangular mesh generation for domains with curved boundaries. Intl. J. Numer. Methods in Engineer., 55 (2002), 1185–1213.
J.-D. Boissonnat and S. Oudot. Provably good sampling and meshing of Lipschitz surfaces. Proc. 22nd Ann. Sympos. Comput. Geom., 2006, 337–346.
J.-D. Boissonnat and S. Oudot. Provably good surface sampling and meshing of surfaces. Graphical Models, 67 (2005), 405–451.
H.-L. Cheng, T. K. Dey, H. Edelsbrunner, and J. Sullivan. Dynamic skin triangulation. Discrete Comput. Geom., 25 (2001), 525–568.
S.-W. Cheng, T. K. Dey, and E. A. Ramos. Delaunay refinement for piecewise smooth complexes. Proc. 18th Annu. ACM-SIAM Sympos. Discrete Algorithms (2007), 1096–1105.
S.-W. Cheng, T. K. Dey, E. A. Ramos and T. Ray. Quality meshing for polyhedra with small angles. Internat. J. Comput. Geom. Appl., 15 (2005), 421–461.
S.-W. Cheng, T. K. Dey, E. A. Ramos and T. Ray. Sampling and meshing a surface with guaranteed topology and geometry. Proc. 20th Annu. Sympos. Comput. Geom., 2004, 280–289.
L. P. Chew. Guaranteed-quality triangular meshes. Report TR-98-983, Comput. Sci. Dept., Cornell Univ., Ithaca, New York, 1989.
L. P. Chew. Guaranteed-quality mesh generation for curved surfaces. Proc. 9th Annu. Sympos. Comput. Geom., 1993, 274–280.
S. Har-Peled and A. Üngör. A time optimal Delaunay refinement algorithm in two dimensions. Proc. Ann. Sympos. Comput. Geom., 2005, 228–236.
T. K. Dey, G. Li, and T. Ray. Polygonal surface remeshing with Delaunay refinement. Proc. 14th Internat. Meshing Roundtable, 2005, 343–361.
H. Edelsbrunner and N. Shah. Triangulating topological spaces. Internat. J. Comput. Geom. Appl., 7 (1997), 365–378.
G. L. Miller, D. Talmor, S.-H. Teng and N. Walkington. A Delaunay based numerical method for three dimensions: generation, formulation, and partition. Proc. 27th Annu. ACM Sympos. Theory Comput. (1995), 683–692.
S. Oudot, L. Rineau, and M. Yvinec. Meshing volumes bounded by smooth surfaces. Proc. 14th Internat. Meshing Roundtable (2005), 203–219.
S. Pav and N. Walkington. Robust three dimensional Delaunay refinement. 13th Internat. Meshing Roundtable 2004.
J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18 (1995), 548–585.
J. R. Shewchuk. Tetrahedral mesh generation by Delaunay refinement. Proc. 14th Annu. Sympos. Comput. Geom. 1998, 86–95.
J. R. Shewchuk. Mesh generation for domains with small angles. Proc. 16th Annu. Sympos. Comput. Geom., 2000, 1–10.
H. Shi and K. Gärtner. Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. Proc. 14th Internat. Meshing Roundtable (2005), 147–164.
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
Cheng, SW., Dey, T.K., Levine, J.A. (2008). A Practical Delaunay Meshing Algorithm for a Large Class of Domains*. 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_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-75103-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75102-1
Online ISBN: 978-3-540-75103-8
eBook Packages: EngineeringEngineering (R0)