{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:44:09Z","timestamp":1725529449800},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851257"},{"type":"electronic","value":"9783540851264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-85126-4_9","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:19:32Z","timestamp":1237288772000},"page":"215-232","source":"Crossref","is-referenced-by-count":0,"title":["Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications"],"prefix":"10.1007","author":[{"given":"Ovidiu","family":"Daescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James Dean","family":"Palmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/conm\/223\/03131","volume":"223","author":"P. Agarwal","year":"1999","unstructured":"Agarwal, P., Erickson, J.: Space-time tradeoffs for emptiness queries, advances in discrete and computational geometry. Contemporary Mathematics\u00a0223, 1\u201356 (1999)","journal-title":"Contemporary Mathematics"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Aleksandrov, Lanthier, Maheshwari, Sack.: An \u03b5-approximation algorithm for weighted shortest paths on polyhedral surfaces. In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory, pp. 11\u201322 (1998)","DOI":"10.1007\/BFb0054351"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Approximation algorithms for geometric shortest path problems. In: Proceedings of the 32nd Annual Symposium on the Theory of Computing, pp. 286\u2013295 (2000)","DOI":"10.1145\/335305.335339"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1044731.1044733","volume":"52","author":"L. Aleksandrov","year":"2005","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Determining approximate shortest paths on weighted polyhedral surfaces. Journal of the ACM\u00a052(1), 25\u201353 (2005)","journal-title":"Journal of the ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/0360-3016(94)90213-5","volume":"28","author":"A. Brahme","year":"1994","unstructured":"Brahme, A.: Optimization of radiation therapy. International Journal of Radiation Oncology Biology Physics\u00a028, 785\u2013787 (1994)","journal-title":"International Journal of Radiation Oncology Biology Physics"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0096-3003(88)90064-1","volume":"25","author":"Y. Censor","year":"1988","unstructured":"Censor, Y., Altschuler, M., Powlis, W.: A computational solution of the inverse problem in radiation-therapy treatment planning. Applied Mathematics and Computation\u00a025, 57\u201387 (1988)","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009885517653","volume":"5","author":"D.Z. Chen","year":"2001","unstructured":"Chen, D.Z., Daescu, O., Hu, X., Wu, X., Xu, J.: Determining an optimal penetration among weighted regions in two and three dimensions. Journal of Combinatorial Optimization\u00a05(1), 59\u201379 (2001)","journal-title":"Journal of Combinatorial Optimization"},{"key":"9_CR8","first-page":"707","volume":"9","author":"D.Z. Chen","year":"2005","unstructured":"Chen, D.Z., Daescu, O., Dai, Y., Katoh, N., Wu, X.: Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications. Journal of Combinatorial Optimization\u00a09, 707\u2013716 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1024484412699","volume":"7","author":"D.Z. Chen","year":"2003","unstructured":"Chen, D.Z., Hu, X., Xu, J.: Optimal beam penetration in two and three dimensions. Journal of Combinatorial Optimization\u00a07(2), 111\u2013136 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"key":"9_CR10","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)","edition":"2"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Daescu, O.: Parallel optimal weighted links. In: Proceedings of ICCS, 1st International Workshop on Computational Geometry and Applications, pp. 649\u2013657 (2001)","DOI":"10.1007\/3-540-45545-0_75"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Daescu, O.: Improved optimal weighted links algorithms. In: Proceedings of ICCS, 2nd International Workshop on Computational Geometry and Applications, pp. 65\u201374 (2002)","DOI":"10.1007\/3-540-47789-6_7"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Daescu, O., Mitchell, J.S.B., Ntafos, S., Palmer, J.D., Yap, C.K.: k-link shortest paths in weighted subdivisions. In: Proceedings of the 9th Annual Workshop on Algorithms and Data Structures, pp. 325\u2013337 (2005)","DOI":"10.1007\/11534273_29"},{"key":"9_CR14","unstructured":"Daescu, O., Palmer, J.: Minimum separation in weighted subdivisions. In: IJCGA (manuscript, submitted to 2003)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Falk, J.E., Palocsay, S.W.: Optimizing the sum of linear fractional functions. Collection: Recent Advances in Global Optimization, 221\u2013258 (1992)","DOI":"10.1515\/9781400862528.221"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gewali, L., Meng, A., Mitchell, J.S., Ntafos, S.: Path planning in 0\/1\/ weighted regions with applications. In: Proceedings of the 4th Annual Symposium on Computational Geometry, pp. 266\u2013278 (1988)","DOI":"10.1145\/73393.73421"},{"key":"9_CR17","unstructured":"Group, T.C.D.: CORE library project, http:\/\/www.cs.nyu.edu\/exact\/core"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Krozel, J., Lee, C., Mitchell, J.S.B.: Estimating time of arrival in heavy weather conditions. In: Proceedings of AIAA Guidance, Navigation, and Control, pp. 1481\u20131495 (1999)","DOI":"10.2514\/6.1999-4232"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Lanthier, M., Maheshwari, A., Sack, J.-R.: Approximating weighted shortest paths on polyhedral surfaces. In: Proceedings of the 13th Annual Symposium on Computational Geometry, pp. 485\u2013486 (1997)","DOI":"10.1145\/262839.262984"},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00453-001-0027-5","volume":"30","author":"M. Lanthier","year":"2001","unstructured":"Lanthier, M., Maheshwari, A., Sack, J.-R.: Approximating shortest paths on weighted polyhedral surfaces. Algorithmica\u00a030(4), 527\u2013562 (2001)","journal-title":"Algorithmica"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1142\/S0218195991000104","volume":"1","author":"D.T. Lee","year":"1991","unstructured":"Lee, D.T., Yang, C.D., Chen, T.H.: Shortest rectilinear paths among weighted obstacles. International Journal of Computational Geometry and Applications\u00a01(2), 109\u2013124 (1991)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"1","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1361-8415(01)80026-8","volume":"2","author":"J. Maintz","year":"1998","unstructured":"Maintz, J., Viergever, M.: A survey of medical image registration. Medical Image Analysis\u00a02(1), 1\u201336 (1998)","journal-title":"Medical Image Analysis"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Mata, C., Mitchell, J.: A new algorithm for computing shortest paths in weighted planar subdivisions. In: Proceedings of the 13th International Annual Symposium on Computational Geometry, pp. 264\u2013273 (1997)","DOI":"10.1145\/262839.262983"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"McCubbin, C.B., Piatko, C.D., Peterson, A.V., Donnald, C.R.: Cooperative organic mine avoidance path planning. In: Proceedings of SPIE Detection and Remediation Technologies for Mines and Minelike Targets, vol.\u00a05794 (2005)","DOI":"10.1117\/12.602815"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S1361-8415(96)80007-7","volume":"1","author":"T. McInerney","year":"1996","unstructured":"McInerney, T., Terzopoulos, D.: Deformable models in medical images analysis: a survey. Medical Image Analysis\u00a01, 91\u2013108 (1996)","journal-title":"Medical Image Analysis"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Mitchell, J., Papadimitriou, C.: The weighted region problem. In: Proceedings of the 3rd Annual Symposium on Computational Geometry, pp. 30\u201338 (1987)","DOI":"10.1145\/41958.41962"},{"key":"9_CR27","unstructured":"Mitchell, J.S.B.: Planning Shortest Paths. Ph.D thesis, Stanford University (August 1986)"},{"key":"9_CR28","volume-title":"Handbook of Computational Geometry","author":"J.S.B. Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry. Elsevier Science, Amsterdam (2000)"},{"issue":"1","key":"9_CR29","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM\u00a038(1), 18\u201373 (1991)","journal-title":"Journal of the ACM"},{"key":"9_CR30","unstructured":"N.L.: of\u00a0Medicine. The visible human project, http:\/\/www.nlm.nih.gov\/research\/visible"},{"key":"9_CR31","unstructured":"Reif, J., Sun, Z.: An efficient approximation algorithm for weighted region shortest path problem. In: Proceedings of the 4th Workshop on Algorithmic Foundations of Robotics, March 16\u201318 (2000)"},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1109\/70.265920","volume":"9","author":"A. Schweikard","year":"1993","unstructured":"Schweikard, A., Adler, J., Latombe, J.: Motion planning in stereotactic radiosurgery. IEEE Transactions on Robotics and Automation\u00a09, 764\u2013774 (1993)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0014497","volume-title":"Applied Computational Geometry. Towards Geometric Engineering","author":"J.R. Shewchuk","year":"1996","unstructured":"Shewchuk, J.R.: Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In: Lin, M.C., Manocha, D. (eds.) FCRC-WS 1996 and WACG 1996. LNCS, vol.\u00a01148, pp. 203\u2013222. Springer, Heidelberg (1996)"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Sun, Z., Reif, J.H.: Adaptive and compact discretization for weighted region optimal path finding. In: Proceedings of the 14th Symposium on Fundamentals of Computation Theory (2003)","DOI":"10.1007\/978-3-540-45077-1_24"},{"issue":"4","key":"9_CR35","first-page":"456","volume":"13","author":"C.D. Yang","year":"1990","unstructured":"Yang, C.D., Chen, T.H., Lee, D.T.: Shortest rectilinear paths among weighted rectangles. Journal of Information Processing\u00a013(4), 456\u2013462 (1990)","journal-title":"Journal of Information Processing"}],"container-title":["Studies in Computational Intelligence","Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85126-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:15:41Z","timestamp":1619522141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85126-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540851257","9783540851264"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85126-4_9","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}