Optimistic parallel Delaunay triangulation

Visual Computer

Volumn 18, Issue 8, 2002, Pages 511-529

  Kolingerová, Ivana ^a   Kohout, Josef ^a  

^a UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

Computational geometry; Computer graphics; Delaunay triangulation; Incremental insertion; Parallelization

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER WORKSTATIONS; TRIANGULATION;

PARALLELIZATION;

COMPUTER GRAPHICS;

EID: 0036910172     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00371-002-0173-z     Document Type: Article

References (49)

1. Aggarwal A., Chazelle B., Guibas L., O'Dunlaig C., Yap C. (1988) Parallel computational geometry. Algorithmica 3(3):293-327.
2. Beichl I., Sullivan F. (1991) Parallelizing computational geometry: first steps. SIAM News 24(6):1-17.
3. de Berg M., van Kreveld M., Overmars M., Schwarzkopf O. (1997) Computational geometry: algorithms and applications. Springer, Berlin Heidelberg New York.
4. Blelloch G.E., Miller G.L., Talmor D. (1996) Developing a practical projection-based parallel Delaunay algorithm. In: Proceedings of the 12th Annual ACM Symposium on Computational Geometry. ACM Press, New York, pp 186-195.
5. Borland Delphi v. 3.0 (1997) On-line help.
6. Chandrasekhar N., Franklin W.R. (1989) A fast practical parallel convex hull algorithm. Technical report. Electrical, Computer and Systems Engineering Department, Rensselaer Polytechnic Institute, Troy, NY.
7. Chow A.L. (1980) Parallel algorithms for geometric problems. PhD Dissertation, Department of Computer Science, University of Illinois, Urbana.
8. Chrisochoides N., Sukup F. (1996). 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. http://www.cs.wm.edu/̃nikos/pes/docs/icngg96.ps.
9. Chrisochoides N., Nave D. (1999) Simultaneous mesh generation and partitioning for Delaunay meshes. In: Proceedings of the 8th International Meshing Roundtable. South Lake Tahoe, CA, USA, pp 55-66.
10. Cignoni P., Montani C., Perego R., Scopigno R. (1993) Parallel 3D Delaunay triangulation. Comput Graph Forum 12(3): 129-142.
11. Clematis A., Puppo E. (1993) Effective parallel processing of irregular geometric structures: an experience with the Delaunay triangulation. In: Proceedings AICA 1993, International Section: Parallel and Distriuted Architectures and Algorithms, Milano, Italy, pp 235-251.
12. Cole R., Goodrich M.T., O'Dunlaig C. (1990) Merging free trees in parallel for efficient Voronoi diagram construction. In: Proceedings of the 17th International Colloquium on Automata, Languages and Programming. Lecture Notes on Computer Science, vol 443. Springer, Berlin Heidelberg New York, pp 432-445.
13. Davy J.R., Dew P.M. (1989) A note on improving the performance of Delaunay triangulation. In: Proceedings of Computer Graphics International '89, pp 209-226.
14. Day A.M. (1991) Parallel implementation of 3D convex hull algorithm, Comput Aided Des 23(3): 177-188.
15. Devillers O. (1989) Improved incremental randomized Delaunay triangulation. In: Proceedings of the 14th Annual ACM Symposium on Computational Geometry. ACM Press, New York, pp 106-115.
16. Ding Y., Densham P.J. (1994) A dynamic and recursive parallel algorithm for constructing Delaunay triangulations. In: Proceedings of the 6th International Symposium on Spatial Data Handling, Edinburgh, UK. Taylor and Francis, pp 682-696.
17. Dwyer R.A. (1986) A simple divide-and-conquer algorithm for constructing Delaunay triangulation in O(n log log n) expected time. In: Proceedings of the 2nd Annual ACM Symposium on Computational Geometry. ACM Press, New York, pp 276-284.
18. Edelsbrunner H., Mücke P. (1990) Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans Comput Graph 9:66-104.
19. 2 h) time algorithm for the three-dimensional convex hull problem. SIAM J Comput 20:259-277.
20. Evans D.J., Stojmenovic I. (1989) On parallel computation of Voronoi diagrams. Parallel Comput 12:121-125.
21. Garland M. (2002) Sample data for terrain simplification, http://graphics.cs.uiuc.edu/̃garland/research/quadrics.html. Cited 17 July 2002.
22. Grouse M., Goodrich M.T. (1991) In-place techniques for parallel convex hull algorithms. In: Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures. ACM Press, New York, pp 192-203.
23. Guibas L.J., Knuth D.E., Sharir M. (1992) Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7:381-413.
24. Hardwick J.C. (1997) Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm. In: 9th Annual Symposium on Parallel Algorithms and Architectures, pp 22-25.
25. ∞) on a Mesh-connected Computer. Parallel Comput 17:241-252.
26. Jeong C.S. (1991) An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer. Parallel Comput 17:505-514.
27. Kolingerová I., Kohout J. (2000) Pessimistic threaded Delaunay triangulation by randomized incremental insertion. In: Graphicon 2000, Moscow, pp 76-83.
28. 28. Kolingerová I. and Žalik B. (2002) Improvements to randomized incremental Delaunay insertion. Comput Graph 26(3):477-490.
29. Magillo P. (1998) Algorithms for parallel terrain modelling and visualization. In: Parallel processing algorithms for GIS. Taylor and Francis, London, pp 351-386.
30. Merriam M.L. (1992) Parallel implementation of an algorithm for Delaunay triangulation. In: 1st European Fluid Dynamics Conference, pp 907-912.
31. Mulmuley K. (1991) Randomized multidimensional search trees: dynamic sampling. In: Proceedings of the 7th Annual ACM Symposium on Computational Geometry. ACM Press, New York, pp 121-131.
32. Modular Visualization Environment (MVE) (2000) User manual. University of West Bohemia, Plzeň, Czech Republic, http://herakles.zcu.cz/research.php.
33. Oishi Y., Sugihara K. (1993) Topology-oriented divide-and-conquer algorithm for Voronoi diagrams. METR 93-12, University of Tokyo.
34. Preparata F.P., Shamos M.I. (1985) Computational geometry: an introduction. Springer, Berlin Heiledberg New York.
35. Puppo E., Davis L.S., DeMenthon D., Teng A. (1994) Parallel terrain triangulation. Int J Geogr Inf Syst 8(2):105-128.
36. Reif J., Sen S. (1989) Polling:a new randomized sampling technique for computational geometry. In: Proceedings of the 21st Annual Symposium on Theory of Computing. ACM Press, New York, pp 394-404.
37. Saxena S., Bhatt P.C., Prasad V.S. (1990) Efficient VLSI parallel algorithm for Delaunay triangulation on orthogonal tree network in two and three dimensions. IEEE Trans Comput 39(3):400-404.
38. Shewchnk J.R. (1996) Triangle: engineering a 2D quality mesh generator and Delaunay triangulator. In: Applied Computational Geometry Towards Geometric Engineering. Lecture Notes on Computer Science vol 1148. Springer, Berlin Heidelberg New York, pp 203-222.
39. Skiena S. (1998) The algorithm design manual. Springer, Berlin Heidelberg New York.
40. Su P. (1994) Efficient parallel algorithms for closest point problems. PhD thesis, Darthmouth College, PCS-TR94-238.
41. Su P. and Drysdale R.L.S. (1995) A comparison of sequential Delaunay triangulation algorithms. In: Proceedings of the 11th Annual Symposium on Computational Geometry. ACM Press, New York, pp 61-70.
42. Teng Y.A., Sullivan F., Beichl I., Puppo E. (1993) A data parallel algorithm for three-dimensional Delaunay triangulation and its implementation. In: Proceedings of SuperComputing '93. ACM Press, New York, pp 112-121.
43. Vemuri B.C., Varadajaran R. and Mayya N. (1992) An efficient expected time parallel algorithm for Voronoi construction. In: Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures. ACM Press, New York, pp 392-400.
44. Wang C.A. and Tsin Y.H. (1987) An O(log n) time parallel algorithm for triangulating a set of points in the plane. Inf Process Lett 25:55-60.
45. Watson D.F. (1981) Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. Comput J 24(2): 167-172.
46. Žalik B. and Kolingerová I. (2002) An incremental insertion algorithm for Delaunay triangulation using the nearest-point paradigm. Submitted to International Journal of Geographical Information Science.
47. Shewchuk J. (2002) http://www.cs.cmu.edu/̃quake/triangle.html. Triangle. Cited 17 July 2002.
48. http://netlib.bell-labs.com/netlib/voronoi/index.html. Cited 17 July 2002.
49. Qhull (2002) http://www.geom.umn.edu/software/qhull. Home page for Qhull. Cited 17 July 2002.