Parallel 2D graded guaranteed quality delaunay mesh refinement

Proceedings of the 14th International Meshing Roundtable, IMR 2005

Volumn , Issue , 2005, Pages 505-517

  Chernikov, Andrev N ^a   Chrisochoides, Nikos P ^a,b,c  

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

^b Massachusetts Institute of Technology Cambridge   (United States)

^c HARVARD MEDICAL SCHOOL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE REUSABILITY;

DELAUNAY REFINEMENTS; EXPERIMENTAL COMPARISON; GUARANTEED QUALITY; LOCAL CONDITIONS; MULTIPLE LEAVES; PARALLEL REFINEMENT; THEORETICAL FRAMEWORK; TWO-DIMENSIONAL GEOMETRY;

MESH GENERATION;

EID: 33847158061     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-29090-7_30     Document Type: Conference Paper

References (23)

1. G. E. Blelloch, J. Hardwick, G. L. Miller, and D. Talmor. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica, 24:243-269, 1999.
2. G. E. Blelloch, G. L. Miller, and D. Talmor. Developing a practical projection-based parallel Delaunay algorithm. In 12th Annual Symposium on Computational Geometry, pages 186-195, 1996.
3. A. Bowyer. Computing Dirichlet tesselations. Computer Journal, 24:162-166, 1981.
4. A. N. Chernikov and N. P. Chrisochoides. Parallel guaranteed quality planar Delaunay mesh generation by concurrent point insertion. In 14th Annual Fall Workshop on Computational Geometry, pages 55-56. MIT, Nov. 2004.
5. A. N. Chernikov and N. P. Chrisochoides. Practical and efficient point insertion scheduling method for parallel guaranteed quality Delaunay refinement. In Proceedings of the 18th annual international conference on Supercomputing, pages 48-57. ACM Press, 2004.
6. N. P. Chrisochoides. A survey of parallel mesh generation methods. Technical Report BrownSC-2005-09, Brown University, 2005. To appear in Numerical Solution of Partial Differential Equations on Parallel Computers (eds. Are Magnus Bruaset, Petter Bjorstad, Aslak Tveito).
7. S. Dong, D. Lucor, and G. E. Karniadakis. Flow past a stationary and moving cylinder: DNS at Re=10,000. In 2004 Users Group Conference (DOD-UGC04), pages 88-95, 2004.
8. H. Edelsbrunner and D. Guoy. Sink-insertion for mesh improvement. In Proceedings of the Seventeenth Annual Symposium on Computational Geometry, pages 115-123. ACM Press, 2001.
9. P.-L. George and H. Borouchaki. Delaunay Triangulation and Meshing. Application to Finite Elements. HERMES, 1998.
10. C. Kadow. Adaptive dynamic projection-based partitioning for parallel Delaunay mesh generation algorithms. In SI AM Workshop on Combinatorial Scientific Computing, Feb. 2004.
11. C. Kadow. Parallel Delaunay Refinement Mesh Generation. PhD thesis, Carnegie Mellon University, 2004.
12. C. Kadow and N. Walkington. Design of a projection-based parallel Delaunay mesh generation and refinement algorithm. In Fourth Symposium on Trends in Unstructured Mesh Generation, July 2003. http://www.andrew.cmu.edu/user/ sowen/usnccm03/agenda.html.
13. G. Karnriadakis and S. Orszag. Nodes, modes, and flow codes. Physics Today, 46:34-42, 1993.
14. L. Linardakis and N. Chrisochoides. Parallel domain decoupling Delaunay method. SIAM Journal on Scientific Computing, in print, accepted Nov. 2004.
15. 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 Twenty-Seventh Annual ACM Symposium on Theory of Computing, pages 683-692. ACM Press, May 1995.
16. D. Nave, N. Chrisochoides, and L. P. Chew. Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains. Computational Geometry: Theory and Applications, 28:191-215, 2004.
17. J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548-585, 1995.
18. J. R. Shewchuk. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Proceedings of the First workshop on Applied Computational Geometry, pages 123-133, Philadelphia, PA, 1996.
19. J. R. Shewchuk. Delaunay Refinement Mesh Generation. PhD thesis, Carnegie Mellon University, 1997.
20. D. A. Spielman, S.-H. Teng, and A. Üngör. Parallel Delaunay refinement: Algorithms and analyses. In Proceedings of the Eleventh International Meshing Roundtable, pages 205-217, 2001.
21. D. A. Spielman, S.-H. Teng, and A. Üngör. Time complexity of practical parallel Steiner point insertion algorithms. In Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 267-268. ACM Press, 2004.
22. R. A. Walters. Coastal ocean models: Two useful finite element methods. Recent Developments in Physical Oceanographic Modelling: Part II, 25:775-793, 2005.
23. D. F. Watson. Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. Computer Journal, 24:167-172, 1981.