Three-dimensional semi-generalized point placement method for Delaunay mesh refinement

Proceedings of the 16th International Meshing Roundtable, IMR 2007

Volumn , Issue , 2008, Pages 25-44

  Chernikov, Andrey N ^a   Chrisochoides, Nikos P ^a  

^a The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL FLEXIBILITIES; CIRCUMSCRIBED SPHERE; DELAUNAY REFINEMENTS; ELEMENT QUALITY; PLACEMENT METHODS; POINT INSERTIONS; THEORETICAL GUARANTEES; THREE DIMENSIONS;

THREE DIMENSIONAL;

EID: 57349143076     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-75103-8_2     Document Type: Conference Paper

References (22)

1. A. Bowyer. Computing Dirichlet tesselations. Computer Journal, 24:162-166, 1981.
2. 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.
3. 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.
4. 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.
5. B. N. Delaunay. Sur la sphere vide. Izvestia Akademia Nauk SSSR, VII Seria, Otdelenie Mataematicheskii i Estestvennyka Nauk, 7:793-800, 1934.
6. 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.
7. P.-L. George and H. Borouchaki. Delaunay Triangulation and Meshing. Application to Finite Elements. HERMES, 1998.
8. 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.
9. X.-Y. Li. Generating well-shaped d-dimensional Delaunay meshes. Theoretical Computer Science, 296(1):145-165, 2003.
10. 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.
11. 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.
12. S. A. Mitchell. 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.
13. 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.
14. J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548-585, 1995.
15. J. R. Shewchuk. Delaunay Refinement Mesh Generation. PhD thesis, Carnegie Mellon University, 1997.
16. 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.
17. J. R. Shewchuk. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications, 22(1-3):21-74, May 2002.
18. H. Si. On refinement of constrained Delaunay tetrahedralizations. In Proceedings of the 15th International Meshing Roundtable, pages 509-528, Birmingham, AL, Sept. 2006. Springer.
19. 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.
20. 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.
21. 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.
22. D. F. Watson. Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. Computer Journal, 24:167-172, 1981.