Terminal Star Operations Algorithm for Tetrahedral Mesh Improvement-Reference-Cited by-同舟云学术

Terminal Star Operations Algorithm for Tetrahedral Mesh Improvement

Published:2019 Issue: Volume: Page:269-282
ISSN:1439-7358
Container-title:Lecture Notes in Computational Science and Engineering
language:
Short-container-title:

Author:

Balboa Fernando,Rodriguez-Moreno Pedro,Rivara María-Cecilia

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-13992-6_15

Reference18 articles.

1. C. Bedregal, M.C. Rivara, Longest-edge algorithms for size-optimal refinement of triangulations. Comput. Aided Des. 46, 246–251 (2014)

2. J. Castaños, J. Savage, PARED: a framework for the adaptive solution of PDEs, in High Performance Distributed Computing, 1999. Proceedings of the Eighth International Symposium on IEEE, 1999, pp. 133–140

3. L. Chen, M. Holst, Efficient mesh optimization schemes based on optimal Delaunay triangulations. Comput. Methods Appl. Mech. Eng. 200, 967–984 (2011)

4. F. Dassi, L. Kamenski, H. Si, Tetrahedral mesh improvement using moving mesh smoothing and lazy searching flips, in 25th International Meshing Roundtable. Procedia Engineering, vol. 163, 2016, pp. 302–314

5. H. Edelsbrunner, D. Guoy, An experimental study of sliver exudation. Eng. Comput. 18, 229–240 (2002)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph-Grammar Based Longest-Edge Refinement Algorithm for Three-Dimensional Optimally p Refined Meshes with Tetrahedral Elements;Computational Science – ICCS 2021;2021

2. Study on the Average Size of the Longest-Edge Propagation Path for Triangulations;Proceedings of the 15th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications;2020

3. Tuned Terminal Triangles Centroid Delaunay Algorithm for Quality Triangulation;Lecture Notes in Computational Science and Engineering;2019