Parallel 2D Delaunay triangulations in HPP and MPI

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages

  Chen, Min Bin ^a   Chuang, Tyng Ruey ^a   Wu, Jan Jau ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; EFFICIENCY; SURVEYING; TRIANGULATION;

BOUNDARY TRIANGULATION; DELAU-NAY TRIANGULATIONS; DISTRIBUTED MEMORY SYSTEMS; HIGH PERFORMANCE FORTRANS; INCREMENTAL CONSTRUCTION; MESSAGE PASSING INTERFACE; PARALLEL IMPLEMENTATIONS; PARALLELIZATION ALGORITHMS;

MESSAGE PASSING;

EID: 84981166215     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.924969     Document Type: Conference Paper

References (13)

1. L. P. Chew, N. Chrisochoides, and F. Sukup. Parallel constrained Delaunay meshing. Proceedings of the Joint ASME/ASCE/SES Sumer Meeting Special Symposium on Trends in Unstructured Mesh Generation, 1997.
2. 3. Concurrency: Practice and Experence, 7(1):61-80, 1995.
3. d. Computer-Aided Design, 30(5):333-341, 1998.
4. R. A. Dwyer. A faster divide and conquer for constructing Delaunay triangulation. Algorithmica, 2:137-151, 1987.
5. T. P. Fang and L. A. Piegl. Delaunay triangulation using a uniform grid. IEEE Computer Graphics and Applications, 13:36-47, 1993.
6. L. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transaction on Graphics, 4(2):74-123, 1985.
7. J. C. Hardwick. Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm. Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997.
8. C. H. Koelbel, D. B. Loveman, R. S. Schreiber, G. L. S. Jr., and M. E. Zosel. The High Performance Fortran Handbook. The MIT Press, 1994.
9. D. T. Lee and B. J. Schachter. Two algorithms for constructing a Delaunay triangulation. International Journal of Computer and Information Sciences, 9(3):219-242, 1980.
10. S. Saxena, P. C. P. Bhatt, and V. C. Prasad. Efficient vlsi parallel algorithm for Delaunay triangulation on orthogonal tree network in two and three dimensions. IEEE Transactions on Computers, 39(3), 1990.
11. J. R. Shewchuk. Triangle: Engineering a 2d quality mesh generator and Delaunay triangulator. Applied Computational Geometry: Towards Geometric Engineeting, 1148:203-222, 1996.
12. P. Su and R. L. S. Drysdale. A comparison of sequential Delaunay triangulation algorithms. Computational Geometry, 7:361-385, 1997.
13. Y. A. Teng, F. Sullivan, I. Beichl, and E. Puppo. A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation. Proceedings of Supercomputing '93, pages 112-121, 1993.