Engineering a compact parallel delaunay algorithm in 3D

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 292-300

  Blandford, Daniel K ^a   Blelloch, Guy E ^a   Kadow, Clemens ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Delaunay; Meshing; Parallel; Space efficient

Indexed keywords

DECODING; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION ANALYSIS; PROGRAM PROCESSORS; RANDOM ACCESS STORAGE;

PARALLEL DELAUNAY ALGORITHM; RELA-BELING; SHARED-MEMORY MACHINE; THREAD-SAFE SPACE-EFFICIENT;

PARALLEL ALGORITHMS;

EID: 33748050127     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137900     Document Type: Conference Paper

References (44)

1. OpenMP. http://www.openmp.org/.
2. rachel.psc.edu. http://www.psc.edu/machines/marvel/rachel.html/.
3. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaig, and C. Yap, Parallel computational geometry. Algorithmica, 3:293-327, 1998.
4. N. M. Amato, M. T. Goodrich, and E, A. Ramos. Parallel algorithms for higher-dimensional convex hulls, In IEEE Symposium on Foundations of Computer Science, pages 683-694, 1994.
5. N. Amenta, S. Choi, and G. Rote, Incremental constructions con BRIO. In Proc. ACM Symposium on Computational Geometry, pages 211-219, June 2003.
6. L. Arge, External memory data structures. In Proc. European Symposium on Algorithms, pages 1-29, 2001.
7. D. Blandford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 2003.
8. D. K. Blandford and G. E. Blelloch, Dictionaries using variable-length keys and data, with applications. In Symposium on Discrete Algorithms, 2005.
9. D. K. Blandford, G. E. Blelloch, D. E. Cardoze, and C. Kadow, Compact representations of simplicial meshes in two and three dimensions. In 12th International Meshing Roundtable, 2003.
10. G. Blelloch, H. Burch, K. Crary, R. Harper, G. Miller, and N. Walkington. Persistent triangulations. Journal of Functional Programming (JFP), 11(5), Sept. 2001.
11. G. Blelloch, J. Hardwick, G. L. Miller, and D. Talmor. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica, 24(3/4):243-269, 1999.
12. A. Bowyer. Computing Dirichlet tessellations, The Computer Journal, 24:162-166, 1981.
13. Chan, Snoeyink, and Yap. Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional voronoi diagrams, GEOMETRY: Discrete & Computational Geometry, 18, 1997.
14. M. Chen, T. Chuang, and J. Wu, Efficient parallel implementations of 2D Delaunay triangulation with high performance Fortran. In Proceedings of 10th SIAM Conference on Parallel Processing for Scientific Computing, 2001.
15. N. Chrisochoides and D. Nave. Simultaneous mesh generation and partitioning for Delaunay meshes, In Proceedings of the Eighth International Meshing Roundtable, pages 55-66, 1999.
16. N. Chrisochoides and D. Nave. Parallel Delaunay mesh generation kernel. International Journal for Numerical Methods in Engineering, 58:161-176, 2003.
17. N. Chrisochoides and F. Sukup. Task parallel implementation of the Bowyer-Watson algorithm. In Proceedings of the Fifth International Conference on Numerical Grid Generation in Computational Fluid Dynamic and Related Fields, 1996.
18. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete & Computational Geometry, 4(1):387-421, 1989.
19. A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, and E. Ramos. Randomized external-memory algorithms for some geometric problems. In Proc. ACM Symposium on Computational Geometry, pages 259-268, June 1998.
20. M. Deering, Geometry compression. In Proc. SIGGRAPH, pages 13-20, 1995.
21. F. K. H. A. Dehne, D. Hutchinson, A. Maheshwari, and W. Dittrich. Reducing I/O complexity by simulating coarse grained parallel algorithms. In Proc. IPPS/SPDP, pages 14-20, 1999.
22. P.-M. Gandoin and O. Devillers. Progressive and lossless compression of arbitrary simplicial complexes. In Proc. SIGGRAPH, 2002.
23. M. T. Goodrich, J.-J, Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 714-723, 1993.
24. M. T. Goodrich, J.-J, Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symposium on Foundations of Computer Science, pages 714-723, Nov. 1993.
25. S. Gumhold and W. Strasser. Real time compression of triangle mesh connectivity. In Proc. SIGGRAPH, pages 133-140, 1998.
26. J. Hardwick. Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm. In Proceedings of Ninth Annual Symposium on Parallel Algorithm and Architectures, 1997.
27. M. Isenburg and J. Snoeyink, Face fixer: Compressing polygon meshes with properties, In Proc. SIGGRAPH, pages 263-270, 2000.
28. Z. Karni and C. Gotsman, Spectral compression of mesh geometry. In Proc. SIGGRAPH, pages 279-286, 2000.
29. J. Kohout, I. Kolingerov, and J. Zara. Practically oriented parallel Delaunay triangulation in E2 for computers with shared memory. Computers and Graphics, 28:703-718, 2004.
30. I. Kolingerov and J. Kohuou, Optimistic parallel Delaunay triangulation, The Visual Computer, 18(8):511-5, 2002.
31. S. Lee, C. Park, and C. Park. An improved parallel algorithm for Delaunay triangulation on distributed memory parallel computers. Parallel Processing Letters, 11:341-352, 2001.
32. S. McMains, J. M. Hellerstein, and C. H. Squin. Out-of-core build of a topological data structure from polygon soup. In Proc. Symposium on Solid Modeling and Applications, pages 171-182, June 2001.
33. T. Okusanya and J. Peraire. 3D parallel unstructured mesh generation. AMD, 220:109-115, 1997.
34. R. Pajarola, J. Rossignac, and A. Szymczak. Implant sprays: Compression of progressive tetrahedral mesh connectivity. In Proc. Visualization 99, pages 299-306, 1999.
35. J. Rossignac. Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics, 5(1):47-61, 1999.
36. J. R. Shewchuk. Pyramid mesh generator software. (http://www.cs.berkeley. edu/~jrs/). Personal Communication.
37. J. R. Shewchuk. Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete and Computational Geometry, 18(3):305-368, 1997.
38. A. Szymczaka and J. Rossignac. Grow & Fold: compressing the connectivity of tetrahedral meshes. Computer-Aided Design, 32:527-537, 2000.
39. G. Taubin and J. Rossignac. Geometric compression through topological surgery. ACM Transactions on Graphics, 17(2):84-115, 1998.
40. T. Tu and D. R. O'Hallaron. A computational database system for generating unstructured hexahedral meshes with billions of elements. In Proceedings of SC2004, 2004.
41. T. Tu, D. R. O'Hallaron, and J. C. Lopez. ETREE - a database-oriented method for generating large octree meshes. In Proc. International Meshing Roundtable, pages 127-138, Sept. 2002.
42. J. S. Vitter. External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys, 33(2):209-271, June 2001.
43. D. F. Watson. Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. The Computer Journal, 24:167-172, 1981.
44. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes. Morgan Kaufman, 1999.