Parallelism in dynamic well-spaced point sets

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 33-42

  Acar, Umut A ^a   Cotter, Andrew ^b   Hudson, Benoit ^c   Türkoglu, Duru ^d  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c AUTODESK RESEARCH   (United States)

^d THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

mesh refinement; multithreading; parallel batch dynamic updates; self adjusting computation; voronoi diagrams; well spaced point sets

Indexed keywords

MESH REFINEMENT; MULTI-THREADING; PARALLEL BATCH; POINT SET; SELF-ADJUSTING COMPUTATIONS; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

COMPUTER GRAPHICS;

EID: 79959676076     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989498     Document Type: Conference Paper

References (27)

1. U. A. Acar. Self-Adjusting Computation. PhD thesis, Department of Computer Science, Carnegie Mellon University, May 2005.
2. U. A. Acar, G. E. Blelloch, M. Blume, and K. Tangwongsan. An experimental analysis of self-adjusting computation. In Programming Language Design and Implementation, 2006.
3. U. A. Acar, G. E. Blelloch, K. Tangwongsan, and D. Türkoǧlu. Robust kinetic convex hulls in 3D. In European Symposium on Algorithms, September 2008.
4. U. A. Acar, A. Cotter, B. Hudson, and D. Türkoǧlu. Dynamic well-spaced point sets. In SCG '10: the 26th Annual Symposium on Computational Geometry, 2010.
5. U. A. Acar, B. Hudson, and D. Türkoǧlu. Kinetic mesh refinement in 2d. In SCG '11: the 27th Annual Symposium on Computational Geometry, 2011.
6. M. Bern, D. Eppstein, and J. R. Gilbert. Provably Good Mesh Generation. J. Computer and System Sciences, 48(3):384-409, 1994.
7. M. W. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. International Journal of Computational Geometry and Applications, 9(6):517-532, 1999.
8. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete Computional Geometry, 8:51-71, 1992.
9. S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello, and S.-H. Teng. Silver exudation. J. ACM, 47(5):883-904, 2000.
10. L. P. Chew. Guaranteed-quality triangular meshes. Technical Report TR-89-983, Department of Computer Science, Cornell University, 1989.
11. Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proceedings of the IEEE, 80(9):1412-1434, 1992. (Pubitemid 23568843)
12. K. L. Clarkson, K. Mehlhorn, and R. Seidel. Four results on randomized incremental constructions. Computational Geometry Theory and Application, 3:185-212, 1993.
13. C. Demetrescu, I. Finocchi, and G. Italiano. Handbook on Data Structures and Applications, chapter 36: Dynamic Graphs. 2005.
14. L. Guibas. Modeling motion. In J. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 1117-1134. Chapman and Hall/CRC, 2nd edition, 2004.
15. M. A. Hammer, U. A. Acar, and Y. Chen. CEAL: A C-based language for self-adjusting computation. In Programming Language Design and Implementation, June 2009.
16. B. Hudson, G. Miller, and T. Phillips. Sparse voronoi refinement. In Proceedings of the 2006 International Meshing Roundtable, 2006.
17. B. Hudson, G. Miller, and T. Phillips. Sparse Parallel Delaunay Mesh Refinement. In SPAA, 2007.
18. B. Hudson and D. Türkoǧlu. An efficient query structure for mesh refinement. In Canadian Conference on Computational Geometry, 2008.
19. H. Jung and K. Mehlhorn. Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees. Inf. Process. Lett., 27:227-236, April 1988.
20. R. Ley-Wild, U. A. Acar, and M. Fluet. A cost semantics for self-adjusting computation. In Principles of Programming Languages, 2009.
21. G. L. Miller, D. Talmor, S.-H. Teng, N. Walkington, and H. Wang. Control Volume Meshes Using Sphere Packing: Generation, Refinement and Coarsening. In Fifth Intl. Meshing Roundtable, pages 47-61, 1996.
22. D. Moore. The cost of balancing generalized quadtrees. In SMA '95: symposium on Solid modeling and app., pages 305-312, New York, NY, USA, 1995. ACM.
23. G. M. Morton. A computer oriented geodetic data base; and a new technique in file sequencing. Technical report, IBM, Ottowa, CA, 1966.
24. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, 1994.
25. S. Pawagi and O. Kaser. Optimal parallel algorithms for multiple updates of minimum spanning trees. Algorithmica, 9:357-381, 1993. (Pubitemid 23675986) (Pubitemid 23675986)
26. O. Schwarzkopf. Dynamic maintenance of geometric structures made easy. In 32nd Annual Symposium on Foundations of Computer Science, pages 197-206, October 1991.
27. D. Talmor. Well-Spaced Points for Numerical Methods. PhD thesis, Carnegie Mellon University, August 1997. CMU-CS-97-164.