Summary
Computational design and analysis has become a fundamental part of industry and academia for use in research, development, and manufacturing. In general, the accuracy of a computational analysis depends heavily on the fidelity of the computational representation of a real-world object or phenomenon. Most mesh generation strategies focus on element quality-with the justification being that downstream applications require high quality geometries in order to achieve a desired level of accuracy. However, element quality should be secondary to accurately representing the underlying physical object or phenomenon. This work seeks to improve the process of creating a computational model of an object of interest by accelerating the process of mesh generation by reducing the need for (often) manual intervention. This acceleration will be accomplished by automatically generating optimal discretizations of curves by minimizing the arc-length deficit. We propose a method for generating optimal discretizations through local optimization of the arc length. Our results demonstrate the robustness and accuracy of our optimal discretization technique.We also discuss how to incorporate our edge grid generator into existing mesh generation software.
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
Bischoff, S., Kobbelt, L.: Structure preserving CAD model repair. Eurographics 24(3) (2005)
CUBIT: Geometry and mesh generation toolkit, http://cubit.sandia.gov
Cheng, S., Dey, T., Shewchuk, J.: Delaunay Mesh Generation. CRC Press (2012)
Marcum, D.: Advancing-front/local-reconnection (ALFR) unstructured grid generation. In: Computational Fluid Dynamics Review, p. 140. World Scientific, Singapore (1998)
McLaurin, D.: Automated, curvature based edge-grid generation. In: Proc. of AlaSim 2012, Huntsville, AL. Alabama Modeling and Simulation Council (2012)
Sarfraz, M.: Interactive Curve Modeling: With Applications to Computer Graphics, Vision, and Image Processing. Springer (2008)
Hughes, T., Cottrell, J., Bazilevs, Y.: Isogeometric analysis: CAD, finite elements, NURBS, exact geometry, and mesh refinement. Comput. Methods Appl. Mech. Engrg. 194, 4135–4195 (2005)
Löhner, R., Parikh, P.: Generation of three-dimentsional unstructured grids by the advancing-front method. Int. J. Numer. Meth. Fl. 8, 1135–1149 (1988)
Shewchuk, J.: Tetrahedral mesh generation by delaunay refinement. In: Proc. of the 14th Annual Symposium on Computational Geometry, pp. 86–95 (1998)
Shewchuk, J.: Delaunay refinement algorithms for triangular mesh generation. Comput. Geom. Theory Appl. 22, 21–74 (2002)
Thompson, J., Soni, B., Weatherill, N. (eds.): Handbook of Grid Generation. CRC Press (1998)
Laug, P., Borouchaki, H.: Curve linearization and discretization for meshing composite parametric surfaces. Commun. Numer. Meth. En. 20, 869–876 (2004)
Macklin, P., Lowengrub, J.: An improved geometry-aware curvature discretization for level set method: Applications to tumor growth. J. Comput. Phys. 215, 392–401 (2006)
Hofer, M., Pottmann, H.: Energy-minimizing splines in manifold. ACM Transactions on Graphics (TOG) - Proc. of ACM SIGGRAPH 2004 23, 284–293 (2004)
El-Zehiry, N., Grady, L.: Fast global optimization of curvature. In: Computer Vision and Pattern Recognition, Princeton, NJ, pp. 3257–3264. IEEE (2010)
Ebeida, M., Davis, R., Fruend, R.: A new fast hybrid adaptive grid generation technique for arbitrary dimensional domains. Int. J. Numer. Meth. Eng. 84, 305–329 (2010)
Quadros, W., Owen, S., Brewer, M., Shimada, K.: Finite element mesh sizing for surfaces using skeleton. In: Proc. of the 13th International Meshing Roundtable (2004)
Cabello, J.: Towards quality surface meshing. In: Proc. of the 12th International Meshing Roundtable (2003)
Cunha, A., Canann, S., Saigal, S.: Automatic boundary sizing for 2d and 3d meshes. In: Proc. of the 6th International Meshing Roundtable (1997)
Cuilliere, J.: A direct method for the automatic discretization of 3D parametric curves. Comput.-Aided Des. 29, 639–647 (1997)
Hermann, S., Klette, R.: A comparative study on 2D curvature estimators. In: Proc. of the International Conference on Computing: Theory and Applications (ICCTA), pp. 584–589 (2007)
Gray, A., Abbena, E., Salamon, S.: Modern Differential Geometry of Curves and Surfaces with Mathematica, pp. 111–115. CRC Press, Boca Raton (1997)
Kreyszig, E.: Differential Geometry, 1st edn., pp. 34–36. Dover Books on Methematics, Dover (1991)
Casey, J. (ed.): A Sequel to the First Six Books of the Elements of Euclid, Containing and Easy Introduction to Modern Geometry with Numerous Examples, 5th edn. Hodges, Figgis, & Co., Dublin (1888)
Weisstein, E.: Ellipse. Online Knowledge Base, http://mathworld.wolfram.com/Sagitta.html
McLaurin, D.: Automated point spacing. Online Tutorial (2010), http://www.simcenter.msstate.edu/docs/solidmesh/automatedpointspacingreport.pdf
Nemhauser, G., Savelsbergh, M., Sigismondi, G.: MINTO, a Mixed INTeger Optimizer. Oper. Res. Letters 15, 47–58 (1994)
MOSEK homepage, http://www.mosek.com/index.php
Ralphs, T., Güzelsoy, M.: The Symphony callable library for mixed integer programming. In: The Next Wave in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces Series, vol. 29, pp. 61–76 (2005)
Horng, J., Li, J.: An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves. Pattern Recogn. Lett. 23, 171–182 (2002)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)
Brent, R.: Algorithms for Minimization Without Derivatives. Prentice-Hall, Englewood Cliffs (1973)
Hybrid optimization parallel search PACKage home page, https://software.sandia.gov/trac/hopspack/wiki
Dantzig, G., Thapa, M.: Linear Programming 1: Introduction. Springer (1997)
Dantzig, G., Thapa, M.: Linear Programming 2: Theory and Extensions. Springer (2003)
Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica 4(4), 373–395 (1984)
Weisstein, E.: Ellipse. Online Knowledge Base, http://mathworld.wolfram.com/Ellipse.html
Freitag, L., Knupp, P.: Tetrahedral mesh improvement via optimization of the element condition number. Int. J. Numer. Meth. Eng. 53, 1377–1391 (2001)
Munson, T.: Mesh shape-quality optimization using the inverse mean-ratio metric. Math. Program. 110, 561–590 (2007)
Kim, J., Panitanarak, T., Shontz, S.: A multiobjective mesh optimization framework for mesh quality improvement and mesh untangling. Int. J. Numer. Meth. Eng. 94, 20–42 (2013)
Sastry, S., Shontz, S., Vavasis, S.: A log-barrier method for mesh quality improvement and untangling. Eng. Comput. (2012) (Published online ahead of print)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
McLaurin, D., Shontz, S.M. (2014). Automated Edge Grid Generation Based on Arc-Length Optimization. In: Sarrate, J., Staten, M. (eds) Proceedings of the 22nd International Meshing Roundtable. Springer, Cham. https://doi.org/10.1007/978-3-319-02335-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-02335-9_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02334-2
Online ISBN: 978-3-319-02335-9
eBook Packages: EngineeringEngineering (R0)