Data generation for geometric algorithms on non-uniform distributions

International Journal of Computational Geometry and Applications

Volumn 9, Issue 6, 1999, Pages 577-597

  Miller, Gary L ^a   Talmor, Dafna ^b   Teng, Shang Hua ^c  

^a Carnegie Mellon University   (United States)

^b CADSI   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Computational geometry; Delaunay triangulations; Mesh generation; Randomized algorithms; Well spaced points

Indexed keywords

EID: 0033271323     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195999000339     Document Type: Article

References (31)

1. S. J. Aarseth and M. Henon and R. Wielen. A Comparison of Numerical Methods for the study of star cluster dynamics. Astronomy and Astrophysics, 37, 183-187, 1974.
2. I. Babuška and A.K. Aziz. On the angle condition in the finite element method. SIAM J. Numer. Anal., 13(2):214-226, 1976.
3. J. L. Bentley and M. I. Shamos. Divide and conquer for linear expected time, In Information Processing Letter, 7 87-91, 1978.
4. J. L. Bentley, B. W. Weide and A. C. Yao. Optimal expected-time algorithms for closest point problems. In ACM Trans. on Mathematical Software, 6(4) 563-580, 1980.
5. M. Bern, D. Eppstein, and J. R. Gilbert. Provably good mesh generation. In FOCS90, 231-241, 1990. IEEE.
6. M. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quad-trees and quality triangulations. In Workshop on Algorithms and Data Structures, Springer LNCS 709, pages 188-199, 1993.
7. M. Bern, D. Eppstein, and F. F. Yao. The expected extremes in a Delaunay triangulation. Inter. J. of Computational Geometry and Appl., 1(1):79-91, 1991.
8. K. Q. Brown. Geometric transforms for fast geometric algorithms. Technical Report CMU-CS-80-101, CMU, 1980. PhD Thesis.
9. R. A. Dwyer. Higher-dimensional Voronoi diagrams in linear expected time. In Proc. 5th Annual ACM Sym. on Computational Geometry, 326-333, 1989.
10. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical CS. Springer-Verlag, 1987.
11. H. Edelsbrunner and R. Seidel. Voronoi diagrams and arrangements. Discrete and Computational Geometry, 1:25-44, 1986.
12. D. Eppstein, G. L. Miller, and S.-H. Teng. A deterministic linear time algorithm for geometric separators and its applications. In Proceedings of 9th ACM Symposium on Computational Geometry, pages 99-108, 1993.
13. J. R. Gilbert, G. L. Miller, and S.-H. Teng. Geometric mesh partitioning: Implementation and experiments. In International Conference of Parallel Processing, pp 418-427 1995.
14. R. M. Karp and J. M. Steele. Probabilistic analysis of heuristics. In Lawler, Lenstra, Rinnooy Kan, and Shmoys, editors, The Traveling SAlesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, N.Y., 1985.
15. R. E. Miles. On the homogeneous planar Poisson point process. Mathematical Biosciences, 6:85-127, 1970.
16. G. L Miller and D. Talmor. Mesh generation using well spaced points. Manuscript, 1995.
17. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Automatic mesh partitioning. In A. George, J. Gilbert, and J. Liu, editors, Sparse Matrix Computations: Graph Theory Issues and Algorithms, IMA Volumes in Mathematics and its Applications. Springer-Verlag, 1993.
18. G. L. Miller, D. Talmor, S.-H. Teng, and N. Walkington. A Delaunay Based Numerical Method for Three Dimensions: generation, formulation, partition. In the proceedings of the twenty-sixth annual ACM symposium on the theory of computing, 47-61, 1995.
19. S. A. Mitchell and S. A. Vavasis. Quality mesh generation in three dimensions. In Proceedings of the ACM Computational Geometry Conference, 212-221, 1992.
20. S. A. Mitchell. Cardinality bounds for triangulations with bounded minimum angle. In Proc. 6th Canadian Conference on Computational Geometry, 326-331, 1994.
21. Omar Ghattas and Xiaogang Li. Private communications, 1996.
22. F. P. Preparata and M. I. Shamos. Computational Geometry An Introduction. Texts and Monographs in Computer Science. Springer-Verlag, 1985.
23. A. A. G. Requicha. Representations of rigid solids: theory, methods, and systems. In ACM Computing Survey, 12, 437-464, 1980.
24. J. Ruppert. A new and simple algorithm for quality 2-dimensional mesh generation. In Third Annual ACM-SIAM Symposium on Discrete Algorithms, 83-92, 1992.
25. H. Samet. The quadtree and related hierarchical data structures. ACM Computing Surveys, pages 188-260, 1984.
26. G. Strang and G. J. Fix. An Analysis of the Finite Element Method. Prentice-Hall, Englewood Cliffs, New Jersey, 1973.
27. P. Su. Efficient parallel algorithms for closest point problems. Technical Report PCS-TR94-238, Dartmouth College, NH, 1994. PhD Thesis.
28. S.-H. Teng. Points, Spheres, and Separators: a unified geometric approach to graph partitioning. PhD thesis, Carnegie-Mellon University, School of Computer Science, 1991. CMU-CS-91-184.
29. Y. A. Teng, F. Sullivan, I. Beichl, and E. Puppo. A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation. In SuperComputing 93, pages 112-121. ACM, 1993.
30. http://simon.cs.cornell.edu/home/vavasis/vavasis.html.
31. F. F. Yao. Computational Geometry. In Algorithms in Complexity, R. A. Earnshaw and B. Wyvel editors, 345-490, Elsevier, Amsterdam, 1990.