Algorithm 870: A static geometric Medial Axis domain decomposition in 2D Euclidean space

ACM Transactions on Mathematical Software

Volumn 34, Issue 1, 2008, Pages

  Linardakis, Leonidas ^a   Chrisochoides, Nikos ^a  

^a William and Mary

Author keywords

Delaunay triangulation; Domain decomposition; Parallel mesh generation

Indexed keywords

DELAUNAY TRIANGULATION; DOMAIN DECOMPOSITION; PARALLEL MESH GENERATION;

ANGLE MEASUREMENT; APPROXIMATION THEORY; BOUNDARY CONDITIONS; PARALLEL ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 38749117575     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1322436.1322440     Document Type: Article

References (37)

1. ATTALI, D., BOISSONNAT, J.-D., AND EDELSBRUNNER, H. Stability and computation of the medial axis-a state-of-the-art report. In Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration. Springer-Verlag, Berlin, Germany.
2. BARKER, K., CHRISOCHOIDES, N., CHERNIKOV, A., AND PMGALI, K. 2004. A load balancing framework for adaptive and asynchronous applications. IEEE Trans. Paral. Distrib. Syst. 15, 2, 183-192.
3. BARNARD, S. T. AND SIMON, H. D. 1994. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurr. Pract. Exper. 6, 101-107.
4. BERGER, M. AND BOKHARI, S. 1985. A partitioning strategy for pdes across multiprocessors. In Proceedings of the 1985 International Conference on Parallel Processing.
5. BLUM, H. 1967. A transformation for extracting new descriptors of shape. In Models for the Perception of Speech and Visual Form. MIT Press, 362-380.
6. BOROUCHAKI, H., GEORGE, P. L., HECHT, F., LAUG, P., AND SALTEL, E. 1997. Delaunay mesh generation governed by metric specifications, Part I. Algorithms and Part II. Applications. Finite Elem. Anal. Design 25, 61-83 and 85-109.
7. BRANDT, J. W. AND ALGAZI, V. R. 1992. Continuous skeleton computation by Voronoi diagram. Comput. Vision, Graph., Image Process. 55, 329-338.
8. CHERNIKOV, A. AND CHRISOCHOIDES, N. 2004. Practical and efficient point insertion scheduling method for parallel guaranteed quality Delaunay refinement. In Proceedings of the 18th Annual International Conference on Supercomputing. Malo, France, 48-57.
9. CHEW, L. P. 1989. Guaranteed quality triangular meshes. Tech. rep. TR-89-983, Department of Computer Science, Cornell University.
10. CHEW, L. P. 1993. Guaranteed-quality mesh generation for curved surfaces. In Proceedings of the 9th Annual Symposium on Computational Geometry. ACM, 274-280.
11. CHEW, L. P., CHRISOCHOIDES, N., AND SUKUP, F. 1997. Parallel constrained Delaunay triangulation. In Proceedings of the ASME/ASCE/SES Special Symposium on Trends in Unstructured Mesh Generation. Evanston, IL, 89-96.
12. CHRISOCHOIDES, N. 1996. Multithreaded model for the dynamic load-balancing of parallel adaptive pde computations. Appl. Numer. Math. 20, 349-365.
13. CHRISOCHOIDES, N. AND NAVE, D. 2003. Parallel Delaunay mesh generation kernel. Int. J. Numer. Meth. Engin. 58, 2, 161-176.
14. DEISTER, F., TREMEL, U., HASAN, O., AND WEATHERILL, N. P. 2004. Fully automatic and fast mesh size specification for unstructured mesh generation. Engin. Comput. 20, 237-248.
15. DONG, S. AND KARNIADAKIS, G. 2005. DNS of flow past a stationary and oscillating rigid cylinder at re = 10,000. J. Fluids Struct. 20, 4, 519-531.
16. GALTIER, J. AND GEORGE, P.-L. 1996. Prepartitioning as a way to mesh subdomains in parallel. In 5th International Meshing Roundtable. Pittsburgh, PA, 107-122.
17. HENDRICKSON, B. AND LELAND, R. W. 1995a. The Chaco user's guide version 2.0. Tech. rep., Sandia National Laboratories.
18. HENDRICKSON, B. AND LELAND, R. W 1995b. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Scien. Comput. 16, 2, 452-469.
19. HENDRICKSON, B. AND LELAND, R. W 1995c. A multi-level algorithm for partitioning graphs. In Proceedings of the ACM / IEEE Conference on Supercomputing. San Diego, CA.
20. KADOW, C. AND WALKINGTON, N. 2003. Design of a projection-based parallel Delaunay mesh generation and refinement algorithm. In 4th Symposium, on Trends in Unstructured Mesh Generation.
21. KARYPIS, G. AND KUMAR, V. 1995a. A fast and high quality multilevel scheme for partitioning irregular graphs. Tech. Rep. TR 95-035, Department of Computer Science, University of Minnesota, MN.
22. KARYPIS, G. AND KUMAR, V. 1995b. MeTis: Unstructured graph partitioning and sparse matrix ordering system, version 2.0. Tech. rep., Department of Computer Science, University of Minnesota, Minneapolis, MN.
23. KERNIGHAN, B. W. AND LIN, S. 1970. An efficient heuristic procedure for partitioning graphs. Bell Sys. Tech. J. 49, 2, 291-307.
24. LINARDAKIS, L. AND CHRISOCHOIDES, N. 2006. Delaunay Decoupling Method for parallel guaranteed quality planar mesh refinement. SIAM J. Scie. Comput. 27, 4, 1394-1423.
25. LÖHNER, R. 1997. Automatic unstructued grid generators. Finite Elem. Anal. Design 25, 111-135.
26. METIS, http://www-users.cs.umn.edu/~karypis/metis/index.html.
27. MVIEW. http://mview.sourceforge.net/.
28. NOUR-OMID, B., RAEFSKY, A., AND LYZENGA, G. 1986. Solving finite element equations on concurrent computers. Amer. Soc. Mech. Eng, 291-307.
29. OWEN, S. J. AND SAIGAL, S. 1997. Neighborhood-based element sizing control for finite element surface meshing. 6th International Meshing Roundtable.
30. RUPPERT, J. 1995. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algor. 18, 3, 548-585.
31. SAID, R., WEATHERILL, N., MORGAN, K., AND VERHOEVEN, N. 1999. Distributed parallel Delaunay mesh generation. Comp. Methods Appl. Mech. Engin. 177, 109-125.
32. SHEWCHUK, J. R. 1996. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied Computational Geometry: Towards Geometric Engineering, M. C. Lin and D. Manocha, Eds. Lecture Notes in Computer Science, vol. 1148. Springer-Verlag, 203-222.
33. SHOWME. http://www.cs.emu.edu/~quake/showme.html.
34. SMITH, B., BJRSTAD, P., AND GROPP, W. 1996. Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, Cambridge, UK.
35. TRIANGLE, http://www.cs.cmu.edu/~quake/triangle.html.
36. WALSHAW, C., CROSS, M., AND EVERETT, M. G. 1997. Parallel dynamic graph partitioning for adaptive unstructured meshes. J. Paral. Distrib. Comput. 47, 2, 102-108.
37. ZHU, J., BLACKER, T., AND SMITH, R. 2002. Background overlay grid size functions. In Proceedings of the 11th International Meshing Roundtable. Sandia National Laboratories, 65-74.