Minimum separation in weighted subdivisions

International Journal of Computational Geometry and Applications

Volumn 19, Issue 1, 2009, Pages 33-57

  Daescu, Ovidiu ^a   Palmer, James ^a  

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

Author keywords

Approximation algorithm; Minimum separation; Polynomial time; Weighted region

Indexed keywords

EID: 65249138209     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195909002824     Document Type: Article

References (34)

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. P. K. Agarwal and J. Erickson, Space-time tradeoffs for emptiness queries, Advances in Discrete and Comp. Geometry, eds. B. Chazelle, J. E. Goodman and R. Pollack, Contemporary Mathematics, Vol. 223, (1999), pp. 1-56.
3. L. Aleksandrov, M. Lanthier, A. Maheshwari and J.-R. Sack, An ε-approximation algorithm for weighted shortest paths on polyhedral surfaces, Proc. 6th Scandinavian Workshop on Algorithm Theory, (1998), pp. 11-22.
4. M. H. Alsuwaiyel and D. T. Lee, Minimal visibility paths inside a simple polygon, Comput. Geom.: Th. Appl. 3 (1993) 1-25.
5. M. H. Alsuwaiyel and D. T. Lee, Finding an approximate minimum-link visibility paths inside a simple polygon, Inform. Process. Lett. 55 (1995) 75-79.
6. T. Asano, L. J. Guibas and T. Tokuyama, Walking in an arrangement topologically, Int. J. Comput. Geom. Appl. 4 (1994) 123-151.
7. J. Bhadury and R. Chandrasekaran, Stock cutting to minimize cutting length, European J. Operat. Res. 88 (1996) 69-87.
8. A. Brahme, Optimization of radiation therapy, Int. J. Radiat. Oncol. Biol. Phys. 28 (1994) 785-787.
9. L. Cai, Y. Xu and B. Zhu, Computing the optimal bridge between two convex polygons, Inform. Process. Lett. 69 (1999) 127-130.
10. The Computational Geometry Algorithms Library, web page at http://www.cgal.org.
11. Y. Censor, M. D. Altschuler and W. D. Powlis, A computational solution of the inverse problem in radiation-therapy treatment planning, Appl. Math. Comput. 25 (1988) 57-87.
12. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane, J. ACM 39 (1992) 1-54.
13. D. Z. Chen. O. Daescu. X. Hu. X. Wu and J. Xu. Determining an optimal penetration among weighted regions in two and three dinrensions, J. Combin. Optim. (Spec. Issue on Optimization Problems in Medical Applications) 5(1) (2001) 59-79.
14. D. Z. Chen, O. Daescu, Y. Dai, N. Katoh, X. Wu and J. Xu, Optimizing the sum of linear fractional functions and applications, Proc. 11th ACM-SIAM Symp. Discrete Algorithms (2000), pp. 707-716.
15. D. Z. Chen, X. Hu and J. Xu, Computing optimal beams in two and three dimensions, J. Combin. Optim. 7(2) (2003) 111-136.
16. I. J. Chiang and R. Tamassia, Optimal shortest path and minimum-link path queries between two convex polygons inside a simple polygonal obstacle, Intl. J. Comput. Geom. Appl. 7 (1997) 85-121.
17. T. H. Gormen, C. E. Leiserson, L. R. Rivest and C. Stein, Introduction to Algorithms, Second Ed. (McGraw-Hill, 2001).
18. O. Daescu, Parallel optimal weighted links, Proc. ICCS, Intl. Workshop on Comp. Geom. and Appl. (2001), pp. 649-657.
19. O. Daescu, Improved optimal weighted links algorithms, Proc. ICCS, 2nd Int. Workshop on Computational Geometry and Applications (2002), pp. 65-74.
20. F. Durand. G. Drettakis and C. Puech, The 3D visibility complex, a new approach to the problems of accurate visibility. Proc. 7th Eurographic Workshop on Rendering (1996), pp. 245-257.
21. F. Durand, G. Drettakis and C. Puech, The visibility skeleton: a powerful and efficient multi-purpose global visibility tool, Proc. ACM SIGGRAPH (1997), pp. 89-100.
22. H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci. 38 (1989) 165-194.
23. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New York, NY, 1979).
24. S. K. Kim and C. S. Shin, Computing the optimal bridge between two polygons, Th. Comput. Syst. 34(4) (2001) 337-352.
25. M. Lanthier. A. Maheshwari and J.-R. Sack. Approximating weighted shortest paths on polyhedral surfaces, Algorithmica 30(4) (2001) 527-562.
26. A. Maheshwari. J. R. Sack and H. Djidjev, Link distance problems, Handbook of Computational Geometry, eds. J.-R.. Sack and J. Urrutia (Elsevier Science, 2000), pp. 519-558.
27. C. Mata and J. S. B. Mitchell, A new algorithm for computing shortest paths in weighted planar subdivisions, Proc. 13th ACM Symp. Comp. Geom. (1997), pp. 264-273.
28. J. S. B. Mitchell, Geometric shortest paths and network optimization, Handbook of Computational Geometry, eds. J.-R.. Sack and J. IJrrutia (Elsevier Science, 2000).
29. J. S. B. Mitchell and C. H. Papadimitriou, The weighted region problem: Finding shortest paths through a weighted planar subdivision, J. ACM 38 (1991) 18-73.
30. J. S. B. Mitchell, C. Piatko and E. M. Arkin, Computing a shortest k-link path in a polygon, Proc. 33rd Ann. IEEE Sympos. Found. Comput. Sci. (1992), pp. 573-582.
31. C. D. Piatko, Geometric bicriteria optimal path problems, PhD thesis. Cornell Univ., 1993.
32. J. H. Reif, An efficient algorithm for the real root and symmetric tridiagonal eigenvalue problem, Revised version (1999) from Proc. 34th Annual IEEE Conf. Foundations of Computer Science (1993). pp. 626-635.
33. J. H. Reif and Z. Sun, An efficient approximation algorithm for weighted-region shortest-path problem. Proc. 4th Workshop on Algorithmic Found. of Robot. (2000), pp. 191-203.
34. A. Schweikard, J. R. Adler and J. C. Latombe, Motion planning in stereotactic radiosurgery, IEEE Trans. Robot. Autom. 9 (1993) 764-774.