Parallel geometric algorithms for multi-core computers

Computational Geometry: Theory and Applications

Volumn 43, Issue 8, 2010, Pages 663-677

  Batista, Vicente H F ^a   Millman, David L ^b   Pion, Sylvain ^c   Singler, Johannes ^d  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b Brooks Computer Science Building   (United States)

^c INRIA   (France)

^d KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

Box intersection; Compact container; Delaunay triangulations; Parallel algorithms; Spatial sort

Indexed keywords

3-DIMENSIONAL; BOX INTERSECTION; COMPUTATIONAL GEOMETRY ALGORITHMS; COMPUTING POWER; DELAUNAY TRIANGULATION; DELAUNAY TRIANGULATIONS; DYNAMIC GRAPH; FOUNDATIONAL ELEMENTS; GEOMETRIC ALGORITHM; INCREMENTAL ALGORITHM; MESH GENERATION ALGORITHM; MULTI CORE; MULTIPLE PROCESSORS; PARALLEL MODE; SHARED MEMORIES; USER INTERVENTION;

CONCURRENCY CONTROL; CONTAINERS; DATA STRUCTURES; GEOMETRY; MESH GENERATION; MICROPROCESSOR CHIPS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; THREE DIMENSIONAL; TRIANGULATION;

COMPUTATION THEORY;

EID: 77953138012     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2010.04.008     Document Type: Article

References (40)

1. A.L. Chow, Parallel algorithms for geometric problems, Ph.D. thesis, University of Illinois, Urbana-Champaign, IL, USA, 1980
2. A. Aggarwal, B. Chazelle, L.J. Guibas, C. Ódúnlaing, and C.-K. Yap Parallel computational geometry Algorithmica 3 1-4 1988 293 327
3. S.G. Akl, and K.A. Lyons Parallel Computational Geometry 1993 Prentice-Hall, Inc. Upper Saddle River, NJ, USA
4. CGAL Computational Geometry Algorithms Library http://www.cgal.org/
5. Y. Liu, and J. Snoeyink A comparison of five implementations of 3D Delaunay tessellation J.E. Goodman, J. Pach, E. Welzl, Combinatorial and Computational Geometry MSRI Publications vol. 52 2005 Cambridge University Press 439 458
6. J. Reinders Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism 2007 O'Reilly Media, Inc.
7. OpenMP Architecture Review Board, OpenMP Application Program Interface, Version 3.0, May 2008
8. J. Singler, B. Kosnik, The GNU libstdc++ parallel mode: software engineering considerations, in: Proc. 1st Intl. Worksh. Multicore Software Eng., 2008, pp. 15-22, doi:10.1145/1370082.1370089
9. J. Singler, P. Sanders, F. Putze, MCSTL: The multi-core standard template library, in: Proc. 13th Eur. Conf. Parallel and Distributed Comp., 2007, pp. 682-694
10. M. Hoffmann, L. Kettner, S. Pion, R. Wein, STL extensions for CGAL, in: CGAL Editorial Board (Ed.), CGAL Manual, 3.5 edition, 2009, http://www.cgal.org/ Manual/3.5/doc-html/cgal-manual/packages.html#Pkg:StlExtension
11. N. Amenta, S. Choi, G. Rote, Incremental constructions con BRIO, in: Proc. 19th ACM Symp. Comp. Geom., 2003, pp. 211-219, doi:10.1145/777792.777824
12. C. Delage, Spatial sorting, in: CGAL Editorial Board (Ed.), CGAL Manual, 3.5 edition, 2009, http://www.cgal.org/Manual/3.5/doc-html/cgal-manual/packages. html#Pkg:SpatialSorting
13. A. Zomorodian, and H. Edelsbrunner Fast software for box intersections Int. J. Comp. Geom. Appl. 12 1-2 2002 143 172
14. L. Kettner, A. Meyer, A. Zomorodian, Intersecting sequences of dD iso-oriented boxes, in: CGAL Editorial Board (Ed.), CGAL Manual, 3.5 edition, 2009, http://www.cgal.org/Manual/3.5/doc-html/cgal-manual/packages.html#Pkg: BoxIntersectionD
15. P. Cignoni, C. Montani, R. Perego, and R. Scopigno Parallel 3D Delaunay triangulation Comput. Graph. Forum 12 3 1993 129 142
16. P. Cignoni, D. Laforenza, C. Montani, R. Perego, and R. Scopigno Evaluation of parallelization strategies for an incremental Delaunay triangulator in E 3 Conc. Pract. Exp. 7 1 1995 61 80
17. S. Lee, C.-I. Park, and C.-M. Park An improved parallel algorithm for Delaunay triangulation on distributed memory parallel computers Parallel Process. Lett. 11 2/3 2001 341 352
18. G.E. Blelloch, J.C. Hardwick, G.L. Miller, and D. Talmor Design and implementation of a practical parallel Delaunay algorithm Algorithmica 24 3 1999 243 269 10.1007/PL00008262
19. M.-B. Chen, T.-R. Chuang, and J.-J. Wu Parallel divide-and-conquer scheme for 2D Delaunay triangulation Conc. Comp. Pract. Exp. 18 12 2006 1595 1612
20. E. Puppo, L.S. Davis, D. De Menthon, and Y.A. Teng Parallel terrain triangulation Int. J. GIS 8 2 1994 105 128
21. C.L. Lawson Software for C 1 surface interpolation J. Rice, Mathematical Software III 1977 Academic Press 161 194
22. N. Chrisochoides, F. Sukup, Task parallel implementation of the Bowyer-Watson algorithm, in: Proc. 5th Intl. Conf. Num. Grid Generation, 1996, pp. 773-782
23. T. Okusanya, J. Peraire, Parallel unstructured mesh generation, in: Proc. 5th Intl. Conf. Num. Grid Generation, 1996, pp. 719-729
24. P.J. Green, and R. Sibson Computing Dirichlet tessellations in the plane Comput. J. 21 2 1978 168 173
25. N. Chrisochoides, and D. Nave Parallel Delaunay mesh generation kernel Int. J. Numer. Methods Eng. 58 2 2003 161 176
26. T. Okusanya, and J. Peraire 3D parallel unstructured mesh generation Trends in Unstructured Mesh Generation Applied Mechanics Division vol. 220 1997 ASME 109 115
27. J. Kohout, I. Kolingerová, and J. ára Parallel Delaunay triangulation in E 2 and E 3 for computers with shared memory Parallel Comput. 31 5 2005 491 522
28. D.K. Blandford, G.E. Blelloch, C. Kadow, Engineering a compact parallel Delaunay algorithm in 3D, in: Proc. 22nd Symp. Comp. Geom., 2006, pp. 292-300, doi:10.1145/1137856.1137900
29. K.L. Clarkson, and P.W. Shor Applications of random sampling in computational geometry, II Disc. Comp. Geom. 4 5 1989 387 421
30. J.R. Shewchuk, Tetrahedral mesh generation by Delaunay refinement, in: Proc. 14th ACM Symp. Comp. Geom., 1998, pp. 86-95
31. C.D. Antonopoulos, F. Blagojevic, A.N. Chernikov, N.P. Chrisochoides, and D.S. Nikolopoulos Algorithm, software, and hardware optimizations for Delaunay mesh generation on simultaneous multithreaded architectures J. Parallel Distributed Comput. 69 7 2009 601 612
32. C.D. Antonopoulos, F. Blagojevic, A.N. Chernikov, N.P. Chrisochoides, and D.S. Nikolopoulos A multigrain Delaunay mesh generation method for multicore SMT-based architectures J. Parallel Distributed Comput. 69 7 2009 589 600
33. M. Herlihy, and N. Shavit The Art of Multiprocessor Programming 2008 Morgan Kaufmann Burlington, MA, USA
34. M. Kulkarni, L.P. Chew, K. Pingali, Using transactions in Delaunay mesh generation, in: Proc. 1st Worksh. Transact. Memory Workloads, 2006
35. M.L. Scott, M.F. Spear, L. Dalessandro, V.J. Marathe, Delaunay triangulation with transactions and barriers, in: Proc. 10th Intl. Symp. Workload Characterization, 2007, pp. 107-113
36. C. Cacaval, C. Blundell, M. Michael, H.W. Cain, P. Wu, S. Chiras, and S. Chatterjee Software transactional memory: why is it only a research toy? Commun. ACM 51 11 2008 40 46
37. J.-D. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec Triangulations in CGAL Comp. Geom. Theory Appl. 22 2002 5 19 10.1016/S0925-7721(01)00054-2 (Pubitemid 34286923)
38. J.-D. Boissonnat, O. Devillers, S. Hornus, Incremental construction of the Delaunay triangulation and the Delaunay graph in medium dimension, in: Proc. 25th ACM Symp. Comp. Geom., 2009, pp. 208-216, doi:10.1145/1542362.1542403
39. O. Devillers, S. Pion, and M. Teillaud Walking in a triangulation Int. J. Found. Comput. Sci. 13 2 2002 181 199
40. S. Pion, M. Teillaud, 3D triangulations, in: CGAL Editorial Board (Ed.), CGAL Manual, 3.5 edition, 2009, http://www.cgal.org/Manual/3.5/doc-html/cgal- manual/packages.html#Pkg:Triangulation3