Approximating center points with iterative radon points

International Journal of Computational Geometry and Applications

Volumn 6, Issue 3, 1996, Pages 357-377

  Clarkson, Kenneth L ^a   Eppstein, David ^b   Miller, Gary L ^c   Sturtivant, Carl ^d   Teng, Shang Hua ^d,e  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Carnegie Mellon University   (United States)

^d University of Minnesota   (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Center point; Computational geometry; Geometric approximation; Iterative method; Randomized algorithm

Indexed keywords

EID: 0030493274     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021819599600023X     Document Type: Article

References (25)

1. N. Alon, I. Bárány, Z. Füredi, and D. J. Kleitmn, "Point selections and weak ε for convex hulls", Manuscript, 1991.
2. N. Alon, J. Spencer, and P. Erdös, The Probabilistic Method, Wiley, New York, 1992.
3. B. Chazelle and J. Matoušek, "On linear-time deterministic algorithms for optimization problems in fixed dimension", 4th ACM Symp. Discrete Algorithms (1993) 281-289.
4. K. L. Clarkson, "A Las Vegas algorithm for linear programming when the dimension is small", In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 452-456, 1988; Revised version: "Las Vegas algorithms for linear and integer programming when the dimension is small" (preprint).
5. R. Cole, M. Sharir, and C. K. Yap, "On k-hulls and related problems", SIAM J. Comput. 16 (1987) 61-77.
6. L. Danzer, J. Fonlupt, and V. Klee, "Helly's theorem and its relatives", Proceedings of Symposia in Pure Mathematics 7, Amer. Math. Soc. (1963) 101-180.
7. D. L. Donoho and M. Gasko, "Breakdown properties of location estimates based on halfspace depth and projected outlyingness", The Annals of Statistics 20 (4) (1992) 1803-1827.
8. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.
9. J. R- Gilbert, G. L. Miller, and S.-H. Teng, "Geometric mesh partitioning: implementation and experiments", In SIAM J. Scientific Computing, to appear 1996.
10. P. E. Gill, W. Murray, and M. H, Wright, Numerical Linear Algebra and Optimization, Addison-Wesley, New York, 1991.
11. D. Haussler and E. Welzl, "Epsilon nets and simplex range queries", Discrete Comput. Geom. 2 (1987) 127-151.
12. S. Jadhav and A. Mukhopadhay, "Computing a center of a finite planar set of points in linear time", 9th ACM Symp. Computational Geometry (1993) 83-90.
13. J. Matoušek, "Approximations and optimal geometric divide-and-conquer", 23rd ACM Symp. Theory of Computing (1991) 512-522.
14. N. Megiddo, "Linear programming in linear time when the dimension is fixed", SIAM J. Comput. 12 (1983) 759-776.
15. G. L. Miller and S.-H. Teng, "Centers and point divisions", Manuscript, Carnegie Mellon University, 1990.
16. 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.
17. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis, "Finite element meshes and geometric separators", SIAM J. Scientific Computing, to appear, 1995.
18. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis, "Separators for spherepackings and nearest neighborhood graphs", submitted to J. ACM, 1995.
19. A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.
20. J. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.
21. S.-H. Teng, "Points, spheres, and separators: a unified geometric approach to graph partitioning", Ph. D. Thesis, Carnegie-Mellon University, School of Computer Science, 1991. Tech. Rep. CMU-CS-91-184.
22. L. Valiant, "Short monotone formulae for the majority function", J. Algorithms, 5, 1984, 363-366.
23. V. N. Vapnik and A. Ya. Chervonenkis, "On the uniform convergence of relative frequencies of events to their probabilities", Theory Probab. Appl, 16 (1971) 264-280.
24. B. W. Weide, "Statistical methods in algorithm design", Ph. D. Thesis, CarnegieMellon University, School of Computer Science, 1978. Tech. Rep. CMU-CS-78-142.
25. F. F. Yao, "A 3-space partition and its application", 15th ACM Symp. Theory of Computing (1983) 258-263.