Parallel Delaunay triangulation in E2 and E3 for computers with shared memory

Parallel Computing

Volumn 31, Issue 5, 2005, Pages 491-522

  Kohout, Josef ^a   Kolingerová, Ivana ^a   Žára, Jiří ^b  

^a UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Computational geometry; Incremental insertion; Parallel Delaunay triangulation

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER ARCHITECTURE; COMPUTER GRAPHICS; FINITE ELEMENT METHOD; MULTIMEDIA SYSTEMS; PARALLEL ALGORITHMS; PROGRAM PROCESSORS;

INCREMENTAL INSERTION; PARALLEL ARCHITECTURES; PARALLEL DELAUNAY TRIANGULATION; SCALABILITY;

PARALLEL PROCESSING SYSTEMS;

EID: 19844376102     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2005.02.010     Document Type: Article

References (45)

1. L. Adamian, R. Jackups, A.T. Binkowski, and J. Liang Higher-order interhelical spatial interactions in membrane proteins Journal of Molecular Biology 327 1 2003 251 272
2. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaig, and C. Yap Parallel computational geometry Algorithmica 3 3 1988 293 327
3. D. Attali, and O.J. Lachaud Delaunay conforming iso-surface, skeleton extraction and noise removal Computational Geometry 19 2-3 2001 175 189
4. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational geometry. Algorithms and applications 1997 Springer-Verlag Berlin 3-540-65620-0
5. E. Béchet, J.C. Cuilliere, and F. Trochu Generation of a finite element MESH from stereolithography (STL) files Computer-Aided Design 34 1 2002 1 17
6. M.B. Chen, T.R. Chuang, and J.J. Wu Efficient parallel implementations of 2D Delaunay triangulation with high performance Fortran Proceedings of 10th SIAM conference on parallel processing for scientific computing, Portsmouth, VI 2001 SIAM Press Philadelphia, PA 11 p.
7. L. Chew, Guaranteed-quality triangular meshes. Tech. Rep. TR-89-983, Cornell University, Ithaca, 1989.
8. S.W. Chung, and S.J. Kim A remeshing algorithm based on bubble packing method and its application to large deformation problems Finite Elements in Analysis and Design 39 4 2003 301 324
9. P. Cignoni, C. Montani, R. Perego, and R. Scopigno Parallel 3D Delaunay triangulation Computer Graphics Forum (Eurographics'93) 12 3 1993 C129 C142
10. N. Chrisochoides, D. Nave, Simultaneous mesh generation and partitioning for Delaunay meshes, in: Proceedings of the 8th International Meshing Roundtable, South Lake Tahoe, CA, USA, 1999, pp. 55-66.
11. N. Chrisochoides, F. Sukup, Task parallel implementation of the Bowyer-Watson algorithm, in: Proceedings of the 5th International Conference on Numerical Grid Generation in Computational Fluid Dynamic and Related Fields, 1996.
12. R.A. Dwyer A simple divide-and-conquer algorithm for constructing Delaunay triangulation in O(n log log n) expected time Proceedings of the 2nd annual symposium on computational geometry 1986 ACM New York 276 284
13. S. Fortune A sweepline algorithm for Voronoi diagrams Algorithmica 2 1987 153 174
14. M. Garland, Sample data for terrain simplification. Available from: 〈http://graphics.cs.uiuc.edu/~garland/research/quadrics.html〉.
15. G. Gonçalves, P. Julien, S. Riazanoff, and B. Cervelle Preserving cartographic quality in DTM interpolation from contour lines ISPRS Journal of Photogrammetry and Remote Sensing 56 3 2002 210 220
16. J.E. Godman, and J. O'Rourke Handbook of discrete and computational geometry 1997 CRC Press Boca Raton
17. L.J. Guibas, D.E. Knuth, and M. Sharir Randomized incremental construction of Delaunay and Voronoi diagrams Algorithmica 7 1992 381 413
18. J.C. Hardwick, Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm, in: Proceedings of 9th Annual Symposium on Parallel Algorithms and Architectures, 1997, pp. 22-25.
19. B. Joe Construction of three-dimensional Delaunay triangulations using local transformations Computer Aided Geometric Design 8 1991 123 142
20. J. Kohout, I. Kolingerová, Parallel Delaunay triangulation based on circum-circle criterion, in: Proceedings of SCCG 2003, April 24-26, 2003, Budmerice, Slovakia, 2003, pp. 85-93.
21. 3: make it simple The Visual Computer 19 7-8 2003 532 548
22. 2 for computers with shared memory Computer and Graphics 28 5 2004 703 718
23. I. Kolingerová, and J. Kohout Optimistic parallel Delaunay triangulation The Visual Computer 18 8 2002 511 529
24. F. Lee Constructing the constrained Delaunay triangulation on the Intel Paragon Proceedings of the 13th annual symposium on computational geometry 1997 ACM New York 464 467
25. S. Lee, C.I. Park, and C.M. Park An improved parallel algorithm for Delaunay triangulation on distributed memory parallel computers Parallel Processing Letters 11 2-3 2001 341 352
26. Modular Visualization Environment. Available from: 〈http://herakles. zcu.cz/research/〉.
27. K.F. Mulchrone Application of Delaunay triangulation to the nearest neighbour method of strain analysis Journal of Structural Geology 25 5 2003 689 702
28. T. Nishioka, H. Tokudome, and M. Kinoshita Dynamic fracture-path prediction in impact fracture phenomena using moving finite element method based on Delaunay automatic mesh generation International Journal of Solids and Structures 38 30-31 2001 5273 5301
29. T. Okusanya, J. Peraire, Parallel unstructured mesh generation, in: Presented at 5th International Conference on Numerical Grid Generation in Computational Fluid Dynamics and Related Fields, Mississippi, 1996.
30. T. Okusanya, J. Peraire, 3D parallel unstructured mesh generation. Available from: 〈http://citeseer.nj.nec.com/article/okusanya97parallel. html〉.
31. V. Ostromoukhov, and R.D. Hersch Stochastic clustered-dot dithering Color imaging: device-independent color, color hardcopy, and graphic arts IV SPIE vol. 3648 1999 496 505
32. J.H. Park, and H.W. Park Fast view interpolation of stereo images using image gradient and disparity triangulation Signal Processing: Image Communication 18 5 2003 401 416
33. L. Prasad, L.R. Rao, A geometric transform for shape feature extraction, in: Proceedings of the 45th SPIE Annual Meeting, San Diego, CA, 2000.
34. E. Puppo, L.S. Davis, D. DeMenthon, and A. Teng Parallel terrain triangulation International Journal of Geographical Information Systems 8 2 1994 105 128
35. J. Sienicki, P. Agrawal, V.D. Agrawal, M.L. Bushnell, Superlinear speedup in multiprocessing environment, in: Proceedings of the First International Workshop on Parallel Processing, 1994, pp. 261-265.
36. D.A. Spielman, H.T. Shang, U. Alper, Parallel Delaunay refinement: algorithms and analyses, In: Proceedings of 11th International Meshing Roundtable, Sandia National Laboratories, September 15-18, 2002, pp. 205-218.
37. Stanford 3D databases. Available from: 〈http://www-graphics. stanford.edu/data/3Dscanrep/〉.
38. P. Sue Efficient parallel algorithms for closest point problems 1994 Dartmouth College Hanover, NH
39. A.M. Tekalp, and J. Ostermann Face and 2-D mesh animation in MPEG-4 Signal Processing: Image Communication 15 4-5 2000 387 421
40. M. Varnuška, I. Kolingerová, Improvements to surface reconstruction by the CRUST algorithm, in: Proceedings of SCCG 2003, April 24-26, 2003, Budmerice, Slovakia, pp. 101-109.
41. N.J. Walkington, J.F. Antaki, G.E. Blelloch, O. Ghattas, I. Melcevic, G.L. Miller, A parallel dynamic-mesh Lagrangian method for simulation of flows with dynamic interfaces. In: Proceedings of the 2000 ACM/IEEE Conference on Supercomputing (CDROM), November 2000, Dallas, TX, USA, p. 26-es.
42. D.F. Watson Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes Computer Journal 24 2 1981 167 172
43. Y. Xiao, and H. Yan Text region extraction in a document image based on the Delaunay tessellation The Pattern Recognition 36 3 2003 799 809
44. B. Žalik Database of terrain data 1999 University of Maribor
45. http://herakles.zcu.cz/research/pdt.