Parallel optimal weighted links

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2073, Issue , 2001, Pages 649-657

  Daescu, Ovidiu ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

MILITARY MAPPING;

COARSE GRAINS; GEOLOGICAL EXPLORATION; WEIGHTED LINKS; WEIGHTED REGIONS;

PARALLEL ALGORITHMS;

EID: 84949641168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45545-0_75     Document Type: Conference Paper

References (19)

1. L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack, "An ε-approximation algorithm for weighted shortest paths on polyhedral surfaces," Proc. of the 6th Scandinavian Workshop on Algorithm Theory, pp. 11-22, 1998.
2. T. Asano, L.J. Guibas and T. Tokuyama, "Walking in an arrangement topologi-cally," Int. Journal of Computational Geometry and Applications, Vol. 4, pp. 123-151, 1994.
3. A. Brahme, "Optimization of radiation therapy," Int. Jouurnal of Radiat. Oncol. Biol. Phys., Vol. 28, pp. 785-787, 1994.
4. B. Chazelle and H. Edelsbrunner, "An optimal algorithm for intersecting line seg-ments in the plane," Journal of ACM, Vol. 39, pp. 1-54, 1992.
5. D.Z. Chen, O. Daescu, X. Hu, X. Wu and J. Xu, "Determining an optimal pene-tration among weighted regions in two and three dimensions," Proceedings of the 15th ACM Symposium on Computational Geometry, pp. 322-331, 1999.
6. D.Z. Chen, O. Daescu, Y. Dai, N. Katoh, X Wu and J. Xu, "Optimizing the sum of linear fractional functions and applications," Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 707-716, 2000.
7. D.Z. Chen, X. Hu and J. Xu, "Optimal Beam Penetration in Two and Three Di-mensions," Proceedings of the 11th Annual International Symposium on Algorithms And Computation, pp. 491-502, 2000.
8. R. Cole, J. Salowe, W. Steiger and E. Szemeredi, "Optimal Slope Selection," SIAm Journal of Computing, Vol. 18, pp. 792-810, 1989.
9. O. Daescu, "On Geometric Optimization Problems", PhD Thesis, May 2000.
10. O. Daescu, "Optimal Link Problem on PIMs", Manuscript, January 2001.
11. H. Edelsbrunner, and L.J. Guibas, "Topologically sweeping an arrangement," Jour-nal of Computer and System Sciences Vol. 38, pp. 165-194, 1989.
12. M Goodrich, "Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors," SIAM Journal on Computing, Vol. 20, pp. 737-755, 1991.
13. M Goodrich, M.R. Ghouse and J. Bright, "Sweep methods for Parallel Computa-tional Geometry," Algorithmica, Vol. 15, pp. 126-153, 1996.
14. A. Gustafsson, B.K. Lind and A. Brahme, "A generalized pencil beam algorithm for optimization of radiation therapy," Med. Phys., Vol. 21, pp. 343-356, 1994.
15. M. Lanthier, A. Maheshwari, and J.-R. Sack, "Approximating weighted shortest paths on polyhedral surfaces," Proc. of the 13th ACM Symp. on Comp. Geometry, pp. 274-283, 1997.
16. C. Mata, and J.S.B. Mitchell, "A new algorithm for computing shortest paths in weighted planar subdivisions," Proc. of the 13th ACM Symp. on Comp. Geometry, pp. 264-273, 1997.
17. J.S.B. Mitchell and C.H. Papadimitriou, "The weighted region problem: Finding shortest paths through a weighted planar subdivision," Journal of the ACM, Vol. 38, pp. 18-73, 1991.
18. A. Schweikard, J.R. Adler and J.C. Latombe, "Motion planning in stereotaxic radiosurgery," IEEE Trans. on Robotics and Automation, Vol. 9, pp. 764-774, 1993.
19. J. Snoeyink and J. Hershberger, "Sweeping Arrangements of Curves," DIMACS Series in Discrete Mathematics, Vol. 6, pp. 309-349, 1991