Sublinear geometrie algorithms

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 531-540

  Chazelle, Bernard ^a   Liu, Ding ^b   Magen, Avner ^c  

^a PRINCETON UNIVERSITY   (United States)

^b Princeton University   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

Approximate shortest paths; Polyhedral intersection; Sublinear algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; PROBLEM SOLVING;

SUBLINEAR ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 0038446906     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Agarwal, P.K., Har-Peled, S., Karia, M. Computing approximate shortest paths on convex polytopes, Algorithmica 33 (2) 1999, 227-242.
2. Agarwal, P.K., Har-Peled, S., Sharir, M., Varadarajan, K. Approximating shortest paths on a convex polytope in three dimensions, J. ACM 44 (1997), 567-584.
3. Agarwal, P.K., Erickson, J. Geometric range searching and its relatives, in "Advances in Discrete and Computational Geometry," eds. Chazelle, B., Goodman, J.E., Pollack, R., Contemporary Mathematics 223, Amer. Math. Soc., 1999, pp. 1-56.
4. Barequet, G., Har-Peled, S. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions, J. Algorithms 38 (2001), 91-109.
5. Chazelle, B. The Discrepancy Method: Randomness and Complexity, Cambridge University Press, 2000; paperback version 2001.
6. Chazelle, B., Dobkin, D.P. Intersection of convex objects in two and three dimensions, J. ACM 34 (1987), 1-27.
7. Chen, J., Han, Y. Shortest paths on a polyhedron, Proc. 6th SOCG (1990), 360-369.
8. Clarkson, K.L., Shor, P.W. Applications of random sampling in computational geometry, II, Disc. Comput. Geom. 4 (1989), 387-421.
9. Czumaj, A., Ergun, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., Sohler, C. Sublinear-time approximation of Euclidean minimum spanning tree, Proc. 14th SODA (2003), to appear.
10. Czumaj, A., Sohler, C. Property testing with geometric queries, Proc. 9th ESA (2001), 266-277.
11. Czumaj, A., Sohler, C., Ziegler, M. Property testing in computational geometry, Proc. 8th ESA (2000), 155-166.
12. Devroye, L., Mücke, E.P., Zhu, B. A note on point location in Delaunay triangulations of random points, Algorithmica 22 (1998), 477-482.
13. Dobkin, D.P., Kirkpatrick, D.G. Determining the separation of preprocessed polyhedra - a unified approach, Proc. 17th ICALP (1990), 400-413.
14. Dudley, R.M. Metric entropy of some classes of sets with differentiable boundaries, J. Approx. Theory 10 (1974), 227-236.
15. Eppstein, D. Dynamic Euclidean minimum spanning trees and extrema of binary functions, Disc. Comput. Geom. 13 (1995), 111-122.
16. Ergun, F., Kannan, S., Kumar, S. Ravi, Rubinfeld, R., Viswanathan, M. Spot-checkers, Proc. STOC (1998), 259-268.
17. Grötschel, M., Lovász, L., Schrijver, A. Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
18. Har-Peled, S. Approximate shortest-path and geodesic diameter on convex polytopes in three dimensions, Disc. Comput. Geom. 21 (1999), 217-231.
19. Kapoor, S., Efficient computation of geodesic shortest paths, Proc. 31rd STOC (1999), 770-779.
20. Matoušek, J. Geometric range searching, ACM Comput. Surv. 26 (1994), 421-461.
21. Mehlhorn, K., Naher, S., Schilz, T., Schirra, S., Seel, M., Seidel, R., Uhrig, C. Checking geometric programs or verification of geometric structures, Comput. Geom.: Theory and Appl. 12 (1999), 85-103.
22. Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H. The discrete geodesic problem, SIAM J. Comput. 16 (1987), 647-668.
23. Mitchell, J.S.B. An algorithmic approach to some problems in terrain nevigation, Autonomous Mobile Robots: Perception, Mapping and Nevigation, IEEEE computer society press, Los Alamitos, CA (1991) 408-427.
24. Mücke, E.P., Saias, I., Zhu, B. Fast randomized point location without preprocessing in two and three-dimensional Delaunay triangulations, Proc. 12th SOCG (1996), 274-283.
25. Mulmuley, K. Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements, JCSS 47 (1993), 437-458.
26. Pogorelov, A.V. Extrinsic geometry of convex surfaces, Volume 35 of Translations of Mathematical Monographs, American Mathematical Society, Providence, RI, 1973.
27. Ron, D. Property testing, a tutorial, to appear in "Handbook on Randomization.".
28. Seidel, R. Small-dimensional linear programming and convex hulls made easy, Disc. Comput. Geom. 6 (1991), 423-434.
29. Sharir, M., Schorr, A. On shortest paths in polyhedral spaces, SIAM J. Comput. 15 (1986), 193-215.