Finding an optimal path without growing the tree

Journal of Algorithms

Volumn 49, Issue 1, 2003, Pages 13-41

  Chen, Danny Z ^a   Daescu, Ovidiu ^b   Hu, Xiaobo Sharon ^c   Xu, Jinhui ^c  

^a University of Notre Dame   (United States)

^b The University of Texas at Dallas   (United States)

^c the State University of New York   (United States)

Author keywords

Arrangements; Computational geometry; Dynamic programming; Optimal paths; Space efficient algorithms

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; DYNAMIC PROGRAMMING; GRAPH THEORY; THEOREM PROVING;

CLIPPED TREES; OPTIMAL PATH; SPACE COMPLEXITY;

ALGORITHMS;

EID: 0242415876     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00080-4     Document Type: Article

References (31)

1. E.G. Anagnostou, L.J. Guibas, V.G. Polimenis, Topological sweeping in three dimensions, in: Proc. SIGAL International Symp. on Algorithms, in: Lecture Notes in Comput. Sci., Vol. 450, Springer-Verlag, 1990, pp. 310-317.
2. T. Asano, L.J. Guibas, T. Tokuyama, Walking in an arrangement topologically, Internat. J. Comput. Geom. Appl. 4 (2) (1994) 123-151.
3. T. Asano, T. Tokuyama, Topological walk revisited, in: Proc. 6th Canadian Conf. on Computational Geometry, 1994, pp. 1-6.
4. L. Bodin, B. Golden, A. Assad, M. Ball, Routing and scheduling of vehicles and crews: The state of the art, Comput. Oper. Res. 10 (1983) 62-212.
5. P. Bose, W. Evans, D. Kirkpatrick, M. McAllister, J. Snoeyink, Approximating shortest paths in arrangements of lines, in: Proc. 8th Canadian Conf. on Computational Geometry, 1996, pp. 143-148.
6. C. Chan, G.H. Young, Single-vehicle scheduling problem on a straight line with time window constraints, in: Proc. 1st Annual International Conf. on Computing and Combinatorics, 1995, pp. 617-626.
7. D.Z. Chen, X. Hu, P.J. Blatner, Efficient algorithms for orthogonal polygon approximation, in: Proc. IEEE International Symposium on Circuits and Systems, 1996, pp. 779-782.
8. D.Z. Chen, J. Xu, Peeling an arrangement topologically, in: Proc. 4th CGC Workshop on Computational Geometry, John Hopkins University, Baltimore, MD, 1999.
9. D.Z. Chen, S. Luan, J. Xu, Topological Peeling and Implementation, in: Proc. 12th Annual International Symposium on Algorithms And Computation (ISAAC), in: Lecture Notes in Comput. Sci., Vol. 2223, Springer-Verlag, 2001, pp. 454-466.
10. V. Chvatal, D.A. Klarner, D.E. Knuth, Selected combinatorial research problems, in: STAN-CS-72-292, 26, Stanford University, June, 1972.
11. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, McGraw-Hill, New York, 1990.
12. T. Dey, Improved bounds on planar k-sets and k-levels, in: Proc. 38th Annual IEEE Symp. on Foundations of Computer Science, 1997, pp. 156-161.
13. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987.
14. H. Edelsbrunner, L.J. Guibas, Topologically sweeping an arrangement, J. Comput. System Sci. 38 (1989) 165-194.
15. H. Edelsbrunner, E.P. Mücke, Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms, ACM Trans. Graphics 9 (1990), 66-104.
16. H. Edelsbrunner, E. Welzl, Constructing belts in two-dimensional arrangements with applications, SIAM J. Comput. 15 (1986) 271-284.
17. D. Eppstein, D. Hart, An efficient algorithm for shortest paths in vertical and horizontal segments, in: Proc. 5th International Workshop on Algorithms and Data Structures, in: Lecture Notes in Comput. Sci., Vol. 1272, Springer-Verlag, 1997, pp. 234-247.
18. D. Eppstein, D. Hart, Shortest paths in an arrangement with k line orientations, in: Proc. 10th Annual ACM-SIAM Symp. Discrete Algorithms, 1999, pp. 310-316.
19. P. Erdös, L. Lovász, E.G. Straus, Dissection graphs of planar point sets, in: J.N. Srivastava, et al. (Eds.), A Survey of Combinatorial Theory, North-Holland, 1973, pp. 139-149.
20. D.S. Hirschberg, A linear-space algorithm for computing maximal common subsequences, Comm. ACM 18 (6) (1975) 341-343.
21. X. Hu, D.Z. Chen, R. Sambandam, Efficient list-approximation techniques for floorplan area minimization, ACM Trans. Design Automat. Electron. Systems 6 (3) (2000) 372-400.
22. P.N. Klein, S. Rao, M.H. Rauch, S. Subramanian, Faster shortest-path algorithms for planar graphs, in: Proc. 26th Annual ACM Symp. Theory of Computing, 1994, pp. 27-37.
23. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
24. L. Lovász, On the number of halving lines, Ann. Univ. Sci. Budapest. Eötvös Sec. Math. 14, (1971) 107-108.
25. U. Manber, Introduction to Algorithms: A Creative Approach, Addison-Wesley, Reading, MA, 1989.
26. S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990.
27. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, 1982.
28. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
29. H.N. Psaraftis, M.M. Solomon, T.L. Magnanti, T.-U. Kim, Routing and scheduling on a shoreline with release times, Manage. Sci. 36 (2) (1990) 212-223.
30. S.S. Skiena, The Algorithm Design Manual, Springer-Verlag, New York, 1998.
31. R.A. Wagner, M.J. Fischer, The string-to-string correction problem, J. ACM 21 (1) (1974) 168-173.