Efficient parallel implementations of near Delaunay triangulation with high performance fortran

Concurrency and Computation: Practice and Experience

Volumn 16, Issue 12, 2004, Pages 1143-1159

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

^a CHINA UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Delaunay triangulation; Parallel computation

Indexed keywords

ALGORITHMS; DATA ACQUISITION; DATA TRANSFER; FINITE DIFFERENCE METHOD; FINITE ELEMENT METHOD; HIGH LEVEL LANGUAGES; INTERFACES (COMPUTER); PARALLEL PROCESSING SYSTEMS;

BOUNDARY TRAIANGULATION; DELAUNAY TRIANGULATION; PARALLEL MACHINES; PARALLELIZATION;

FORTRAN (PROGRAMMING LANGUAGE);

EID: 4744366211     PISSN: 15320626     EISSN: None     Source Type: Journal    
DOI: 10.1002/cpe.802     Document Type: Article

References (16)

1. Owen SJ. A survey of unstructured mesh generation technology. Proceedings of the 7th International Meshing Roundtable. http://www.andrew.cmu.edu/user/ sowen/survey/ [1998].
2. d. Computer-Aided Design 1998; 30:333-341.
3. Hardwick JC. Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm. Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997.
4. Teng YA, Sullivan F, Beichl I, Puppo E. A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation. Proceedings of Supercomputing '93, 1993; 112-121.
5. Chew LP, Chrisochoides N, Sukup F. Parallel constrained Delaunay meshing. Proceedings of the Joint ASME/ASCE/SES Summer Meeting Special Symposium on Trends in Unstructured Mesh Generation, 1997.
6. Merriam ML. Parallel implementation of an algorithm for Delaunay triangulation. Proceedings of Computational Fluid Dynamics 1992; 2:907-912.
7. 3. Concurrency: Practice and Experience 1995; 7:61-80.
8. Fang TP, Piegl LA. Delaunay triangulation using a uniform grid. IEEE Computer Graphics and Applications 1993; 13:36-47.
9. Dwyer RA. A faster divide and conquer algorithm for constructing Delaunay triangulation. Algorithmica 1987; 2:137-151.
10. Su P, Drysdale SRL. A comparison of sequential Delaunay triangulation algorithms. Proceedings of the 11th ACM Computational Geometry Conference, 1995; 61-70.
11. Guibas L, Stolfi J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics 1985; 4:74-123.
12. Shewchuk JR. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. Applied Computational Geometry: Towards Geometric Engineering 1996; 1148:203-222.
13. Lee DT, Schachter BJ. Two algorithms for constructing the Delaunay triangulation. International Journal of Computer and Information Sciences 1980; 9:219-242.
14. Dey TK, Sugihara K, Bajaj CL. Delaunay triangulation in three dimensions with finite precision. Computer Aided Geometric Design 1992; 9:457-470.
15. Fortune S. Efficient exact arithmetic for computational geometry. Proceedings of the 9th Annual Symposium on Computational Geometry, 1993; 163-172.
16. Fortune S. Numerical stability of algorithms fort 2D Delaunay triangulation. International Journal of Computational Geometry and Applications 1995; 5:193-213.