Summary
We present a particle-based approach for generating adaptive triangular surface and tetrahedral volume meshes from CAD models. Input shapes are treated as a collection of smooth, parametric surface patches that can meet non-smoothly on boundaries. Our approach uses a hierarchical sampling scheme that places particles on features in order of increasing dimensionality. These particles reach a good distribution by minimizing an energy computed in 3D world space, with movements occurring in the parametric space of each surface patch.
Rather than using a pre-computed measure of feature size, our system automatically adapts to both curvature as well as a notion of topological separation. It also enforces a measure of smoothness on these constraints to construct a sizing field that acts as a proxy to piecewise-smooth feature size. We evaluate our technique with comparisons against other popular triangular meshing techniques for this domain.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alliez, P., Cohen-Steiner, D., Yvinec, M., Desbrun, M.: Variational tetrahedral meshing. ACM Trans. Graph. 24(3), 617–625 (2005)
Amenta, N., Bern, M.W.: Surface reconstruction by Voronoi filtering. Discrete & Computational Geometry 22(4), 481–504 (1999)
Antani, L., Delage, C., Alliez, P.: Mesh sizing with additively weighted Voronoi diagrams. In: 16th IMR, pp. 335–346 (2007)
Boissonnat, J.-D., Oudot, S.: Provably good sampling and meshing of surfaces. Graphical Models 67(5), 405–451 (2005)
Chen, L.: Mesh smoothing schemes based on optimal Delaunay triangulations. In: 13th IMR, pp. 109–120 (2004)
Cheng, S.-W., Dey, T.K.: Maintaining deforming surface meshes. In: 19th Symp. on Discrete Algorithms, pp. 112–121 (2008)
Cheng, S.-W., Dey, T.K., Levine, J.A.: A practical Delaunay meshing algorithm for a large class of domains. In: 16th IMR, pp. 477–494 (2007)
Cheng, S.-W., Dey, T.K., Ramos, E.A.: Delaunay refinement for piecewise smooth complexes. Discrete & Computational Geometry 43(1), 121–166 (2010)
Cheng, S.-W., Poon, S.-H.: Three-dimensional Delaunay mesh generation. Discrete & Computational Geometry 36(3), 419–456 (2006)
Chew, L.P.: Guaranteed-quality triangular meshes. Technical Report TR-89-983, Comp. Science Dept., Cornell University (1989)
Dey, T.K., Levine, J.A.: Delaunay meshing of piecewise smooth complexes without expensive predicates. Algorithms 2(4), 1327–1349 (2009)
Dey, T.K., Li, G., Ray, T.: Polygonal surface remeshing with Delaunay refinement. In: 14th IMR, pp. 343–361 (2005)
Dey, T.K., Sun, J.: Normal and feature approximations from noisy point clouds. In: Found. of Soft. Tech. and Theor. Comp. Sci., pp. 21–32 (2006)
Du, Q., Wang, D.: Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations. Intl. J. Numerical Methods in Engr. 56(9), 1355–1373 (2003)
Haimes, R., Aftosmis, M.J.: On generating high quality watertight triangulations directly from CAD. In: Intl. Soc. for Grid Gen. (2002)
Haimes, R., Follen, G.J.: Computational analysis programming interface. In: 6th Intl. Conf. Num. Grid Gen. in Comp. Field Sim., pp. 663–672 (1998)
Hart, J.C., Bachta, E., Jarosz, W., Fleury, T.: Using particles to sample and control more complex implicit surfaces. In: SIGGRAPH 2005 Courses, New York, NY, USA, p. 269 (2005)
Jones, W.T.: Toward a global parameterization for quilted CAD entities. In: 42nd AIAA Aerospace Sciences Meeting and Exhibit, AIAA Paper 2004-0611 (January 2004)
Karkanis, T., Stewart, A.J.: Curvature-dependent triangulation of implicit surfaces. IEEE Computer Graphics and Applications 21(2), 60–69 (2001)
Lohner, R.: Surface gridding from discrete data. In: 4th IMR, pp. 29–44 (1995)
Meyer, M.D.: Dynamic particles for adaptive sampling of implicit surfaces. PhD thesis, Salt Lake City, UT, USA (2008)
Meyer, M.D., Kirby, R.M., Whitaker, R.T.: Topology, accuracy, and quality of isosurface meshes using dynamic particles. IEEE Trans. Vis. Comput. Graph. 13(6), 1704–1711 (2007)
Meyer, M.D., Whitaker, R.T., Kirby, R.M., Ledergerber, C., Pfister, H.: Particle-based sampling and meshing of surfaces in multimaterial volumes. IEEE Trans. Vis. Comput. Graph. 14(6), 1539–1546 (2008)
Rineau, L., Yvinec, M.: Meshing 3d domains bounded by piecewise smooth surfaces. In: 16th IMR, pp. 443–460 (2007)
Ruppert, J.: A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms 18(3), 548–585 (1995)
Scheidegger, C.E., Fleishman, S., Silva, C.T.: Triangulating point set surfaces with bounded error. In: Symp. on Geom. Proc., pp. 63–72 (2005)
Schreiner, J.M., Scheidegger, C.E., Fleishman, S., Silva, C.T.: Direct (re)meshing for efficient surface processing. Comput. Graph. Forum 25(3), 527–536 (2006)
Shewchuk, J.R.: Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In: Lin, M.C., Manocha, D. (eds.) FCRC-WS 1996 and WACG 1996. LNCS, vol. 1148, pp. 203–222. Springer, Heidelberg (1996)
Shewchuk, J.R.: Tetrahedral mesh generation by Delaunay refinement. In: 14th Symp. on Comp. Geom., pp. 86–95 (1998)
Si, H., Gärtner, K.: Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. In: 14th IMR, pp. 147–163 (2005)
Tournois, J., Alliez, P., Devillers, O.: Interleaving Delaunay refinement and optimization for 2d triangle mesh generation. In: 16th IMR, pp. 83–101 (2007)
Tournois, J., Wormser, C., Alliez, P., Desbrun, M.: Interleaving Delaunay refinement and optimization for practical isotropic tetrahedron mesh generation. ACM Trans. Graph. 28(3) (2009)
Turk, G.: Re-tiling polygonal surfaces. In: SIGGRAPH 1992, pp. 55–64 (1992)
Valette, S., Chassery, J.-M., Prost, R.: Generic remeshing of 3d triangular meshes with metric-dependent discrete Voronoi diagrams. IEEE Trans. Vis. Comput. Graph. 14(2), 369–381 (2008)
Witkin, A.P., Heckbert, P.S.: Using particles to sample and control implicit surfaces. In: SIGGRAPH 1994, pp. 269–277 (1994)
Yamakawa, S., Shimada, K.: High quality anisotropic tetrahedral mesh generation via ellipsoidal bubble packing. In: 9th IMR, pp. 263–274 (2000)
Yan, D.-M., Lévy, B., Liu, Y., Sun, F., Wang, W.: Isotropic remeshing with fast and exact computation of restricted Voronoi diagram. Comput. Graph. Forum 28(5), 1445–1454 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bronson, J.R., Levine, J.A., Whitaker, R.T. (2010). Particle Systems for Adaptive, Isotropic Meshing of CAD Models. In: Shontz, S. (eds) Proceedings of the 19th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15414-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-15414-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15413-3
Online ISBN: 978-3-642-15414-0
eBook Packages: EngineeringEngineering (R0)