Sublinear geometric algorithms

SIAM Journal on Computing

Volumn 35, Issue 3, 2005, Pages 627-646

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

^a Princeton University   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Approximate shortest paths; Polyhedral intersection; Sublinear algorithms

Indexed keywords

APPROXIMATE SHORTEST PATHS; POLYHEDRAL INTERSECTION; SUBLINEAR ALGORITHMS; VORONOI DIAGRAMS;

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING;

COMPUTATIONAL GEOMETRY;

EID: 33745451951     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970444572X     Document Type: Article

References (33)

1. P. K. AGARWAL, S. HAR-PELED, AND M. KARIA, Computing approximate shortest paths on convex polytopes, Algorithmica, 33 (1999), pp. 227-242.
2. P. K. AGARWAL, S. HAR-PELED, M. SHARIR, AND K. VARADARAJAN, Approximating shortest paths on a convex polytope in three dimensions, J. ACM, 44 (1997), pp. 567-584.
3. P. K. AGARWAL AND J. ERICKSON, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Goodman, and R. Pollack, eds., Contemp. Math. 223, AMS, Providence, RI, 1999, pp. 1-56.
4. G. BAREQUET AND S. HAR-PELED, Efficiently approximating the minimum-volume bounding box of a point set in three dimensions, J. Algorithms, 38 (2001), pp. 91-109.
5. B. CHAZELLE, The Discrepancy Method: Randomness and Complexity, Cambridge University Press, Cambridge, UK, 2000.
6. B. CHAZELLE AND D. P. DOBKIN, Intersection of convex objects in two and three dimensions, J. ACM, 34 (1987), pp. 1-27.
7. J. CHEN AND Y. HAN, Shortest paths on a polyhedron, in Proceedings of the Sixth Annual Symposium on Computational Geometry, ACM, New York, 1990, pp. 360-369.
8. K. L. CLARKSON AND P. W. SHOR, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
9. K. L. CLARKSON, Las Vegas algorithms for linear and integer programming when the dimension is small, J. ACM, 42 (1995), pp. 488-499.
10. A. CZUMAJ, F. ERGUN, L. FORTNOW, A. MAGEN, I. NEWMAN, R. RUBINFELD, AND C. SOHLER, Sublinear-time approximation of Euclidean minimum spanning tree, in Proceedings of the Fourteenth Annual Symposium on Discrete Algorithms, ACM, New York, 2003, pp. 813-822.
11. A. CZUMAJ AND C. SOHLER, Property testing with geometric queries, in Proceedings of the 9th Annual European Symposium on Algorithms, Springer-Verlag, Heidelberg, 2001, pp. 266-277.
12. A. CZUMAJ, C. SOHLER, AND M. ZIEGLER, Property testing in computational geometry, in Proceedings of the 8th Annual European Symposium on Algorithms, Springer-Verlag, Heidelberg, 2000, pp. 155-166.
13. M. DE BERG, M. VAN KREVELD, M. OVERMARS, AND O. SCHWARZKOPF, Computational Geometry: Algorithms and Applications, Springer-Verlag, Berlin, 1997.
14. L. DEVROYE, E. P. MÜCKE, AND B. ZHU, A note on point location in Delaunay triangulations of random points, Algorithmica, 22 (1998), pp. 477-482.
15. D. P. DOBKIN AND D.G. KIRKPATRICK, Determining the separation of preprocessed polyhedra-a unified approach, in Automata, Languages and Programming, Springer-Verlag, New York, 1990, pp. 400-413.
16. R. M. DUDLEY, Metric entropy of some classes of sets with differentiable boundaries, J. Approx. Theory, 10 (1974), pp. 227-236.
17. D. EPPSTEIN, Dynamic Euclidean minimum spanning trees and extrema of binary functions, Discrete Comput. Geom., 13 (1995), pp. 111-122.
18. F. ERGUN, S. KANNAN, KUMAR, S. RAVI, R. RUBINFELD, AND M. VISWANATHAN, Spot-checkers, J. Comput. System Sci., 60 (2000), pp. 717-751.
19. B. GÄRTNER AND E. WELZL, A simple sampling lemma: Analysis and applications in geometric optimization, Discrete Comput. Geom., 25 (2001), pp. 569-590.
20. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
21. S. HAR-PELED, Approximate shortest-path and geodesic diameter on convex polytopes in three dimensions, Discrete Comput. Geom., 21 (1999), pp. 217-231.
22. S. KAPOOR, Efficient computation of geodesic shortest paths, in Proceedings of the 31st Annual Symposium on Theory of Computing, ACM, New York, 1999, pp. 770-779.
23. J. MATOUŠEK, Geometric range searching, ACM Comput. Surv., 26 (1994), pp. 421-461.
24. K. MEHLHORN, S. NAHER, T. SCHILZ, S. SCHIRRA, M. SEEL, R. SEIDEL, AND C. UHRIG, Checking geometric programs or verification of geometric structures, Comput. Geom., 12 (1999), pp. 85-103.
25. J. S. B. MITCHELL, D. M. MOUNT, AND C. H. PAPADIMITRIOU, The discrete geodesic problem, SIAM J. Comput., 16 (1987), pp. 647-668.
26. J. S. B. MITCHELL, An algorithmic approach to some problems in terrain navigation, in Autonomous Mobile Robots: Perception, Mapping and Navigation, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 408-427.
27. E. P. MÜCKE. I. SAIAS. AND B. ZHU, Fast randomized point location without preprocessing in two and three-dimensional Delaunay triangulations, Comput. Geom., 12 (1999), pp. 63-83.
28. K. MULMULEY, Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements, J. Comput. System Sci., 47 (1993), pp. 437-458.
29. A. V. POGORELOV, Extrinsic geometry of convex surfaces, Transl. Math. Monogr. 35, AMS. Providence, RI, 1973.
30. D. RON, Property testing, in Handbook on Randomization, Vol. II, S. Rajasekaran, P. M. Pardalos, J. H. Reif, and J. D. P. Rolim, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
31. R. SEIDEL, Small-dimensional linear programming and convex hulls made easy, Discrete Coinput. Geom., 6 (1991), pp. 423-434.
32. M. SHARIR AND A. SCHORR, On shortest paths in polyhedral spaces, SIAM J. Comput., 15 (1985), pp. 193-215.
33. A. C. YAO, Probabilistic computations: Towards a unified measure of complexity, in Proceedings of the 18th Animal Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1977, pp. 222-227.