{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:14:57Z","timestamp":1775229297436,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540220572","type":"print"},{"value":"9783540247678","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24767-8_7","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:45:04Z","timestamp":1284165904000},"page":"62-70","source":"Crossref","is-referenced-by-count":16,"title":["Shortest Paths for Disc Obstacles"],"prefix":"10.1007","author":[{"given":"Deok-Soo","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwangseok","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngsong","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donguk","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chee","family":"Yap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility of disjoint polyongs. Algorithmica\u00a01, 49\u201363 (1986)","journal-title":"Algorithmica"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/21.148404","volume":"22","author":"C. Alexopoulos","year":"1992","unstructured":"Alexopoulos, C., Griffin, P.M.: Path planning for a mobile robot. IEEE Transactions on Systems, Man, and Cybernetics\u00a022(2), 318\u2013322 (1992)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.J.: Topologically sweeping an arrangement. J. Comput. System Sci.\u00a038, 165\u2013194 (1989)","journal-title":"J. Comput. System Sci."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1014310721543","volume":"22","author":"M. Gavrilova","year":"2002","unstructured":"Gavrilova, M.: On a nearest-neighbor problem under Minkowski and power metrics for large data sets. The Journal of Supercomputing\u00a022, 87\u201398 (2002)","journal-title":"The Journal of Supercomputing"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"S.K. Ghosh","year":"1991","unstructured":"Ghosh, S.K., Mount, D.: An output sensitive algorithm for computing visibility graphs. SIAM J. Comput.\u00a020, 888\u2013910 (1991)","journal-title":"SIAM J. Comput."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Kapoor, S., Maheswari, S.N.: Efficient algorithms for Euclidean shortest paths and visibility problems with polygonal obstacles. In: Proc. 4th Annu. ACM Sympos. Comput. Geometry, pp. 178\u2013182 (1988)","DOI":"10.1145\/73393.73411"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/S0167-8396(01)00050-4","volume":"18","author":"D.-S. Kim","year":"2001","unstructured":"Kim, D.-S., Kim, D., Sugihara, K.: Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology. Computer Aided Geometric Design\u00a018, 541\u2013562 (2001)","journal-title":"Computer Aided Geometric Design"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0167-8396(01)00051-6","volume":"18","author":"D.-S. Kim","year":"2001","unstructured":"Kim, D.-S., Kim, D., Sugihara, K.: Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry. Computer Aided Geometric Design\u00a018, 563\u2013585 (2001)","journal-title":"Computer Aided Geometric Design"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. In: Proc. 9th Annu. ACM Sympos. Comput. Geom., pp. 308\u2013317 (1993)","DOI":"10.1145\/160985.161156"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Mucke, E.P., Saias, I., Zhu, B.: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. In: Proc. 12th Annu. ACM Sympos. Comput. Geom, pp. 274\u2013283 (1996)","DOI":"10.1145\/237218.237396"},{"key":"7_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9780470317013","volume-title":"Spatial Tessellations Concepts and Applications of Voronoi Diagrams","author":"A. Okabe","year":"2000","unstructured":"Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester (2000)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Pocchiola, M., Vegter, G.: Computing visibility graphs via pseudo-triangulations. In: Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 248\u2013257 (1995)","DOI":"10.1145\/220279.220306"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0925-7721(95)00016-X","volume":"6","author":"M. Pocchiola","year":"1996","unstructured":"Pocchiola, M., Vegter, G.: Minimal tangent visibility graphs. Computational Geometry Theory and Applications\u00a06, 303\u2013314 (1996)","journal-title":"Computational Geometry Theory and Applications"},{"key":"7_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"issue":"5","key":"7_CR15","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1109\/70.163777","volume":"8","author":"E. Rimon","year":"1992","unstructured":"Rimon, E., Koditschek, D.E.: Exact robot navigation using artificial potential functions. IEEE Transactions on robotics and automation\u00a08(5), 501\u2013518 (1992)","journal-title":"IEEE Transactions on robotics and automation"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(86)90045-1","volume":"23","author":"H. Rohnert","year":"1986","unstructured":"Rohnert, H.: Shortest paths in the plane with convex polygonal obstacles. Inform. Process. Lett.\u00a023, 71\u201376 (1986)","journal-title":"Inform. Process. Lett."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(88)90022-1","volume":"27","author":"H. Rohnert","year":"1988","unstructured":"Rohnert, H.: Time and space efficient algorithms for shortest paths between convex polygons. Inform. Process. Lett.\u00a027, 175\u2013179 (1988)","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"7_CR18","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1145\/185675.185795","volume":"41","author":"J.A. Storer","year":"1994","unstructured":"Storer, J.A., Reif, J.H.: Shortest paths in the plane with polygonal obstacles. Journal of the Association for Computing Machinery\u00a041(5), 982\u20131012 (1994)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01840385","volume":"5","author":"S. Sudarshan","year":"1990","unstructured":"Sudarshan, S., Rangan, C.P.: A fast algorithm for computing sparse visibility graphs. Algorithmica\u00a05, 201\u2013214 (1990)","journal-title":"Algorithmica"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/70.563653","volume":"13","author":"S. Sundar","year":"1997","unstructured":"Sundar, S., Shiller, Z.: Optimal obstacle avoidance based on the Hamilton-Jacobi- Bellman equation. IEEE Transactions on robotics and automation\u00a013(2), 305\u2013310 (1997)","journal-title":"IEEE Transactions on robotics and automation"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24767-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:55:35Z","timestamp":1605761735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24767-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220572","9783540247678"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24767-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}