{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:10:20Z","timestamp":1764173420083,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74472-6_9","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T16:31:01Z","timestamp":1188318661000},"page":"110-121","source":"Crossref","is-referenced-by-count":2,"title":["Shortest Path Queries in a Simple Polygon for 3D Virtual Museum"],"prefix":"10.1007","author":[{"given":"Chenglei","family":"Yang","sequence":"first","affiliation":[]},{"given":"Meng","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Jiaye","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaoting","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiangxu","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational geometry: algorithms and applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overrmars, M., chwarzkopf, O.: Computational geometry: algorithms and applications, 2nd edn. Springer, New York (2000)","edition":"2"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","first-page":"62","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"K. Deok-Soo","year":"2004","unstructured":"Deok-Soo, K., Yu, K., Cho, Y., Kim, D., Yap, C.: Shortest Paths for Disc Obstacles. In: Lagan\u00e0, A., Gavrilova, M., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03043, pp. 62\u201370. Springer, Heidelberg (2004)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.comgeo.2005.11.007","volume":"36","author":"R. Wein","year":"2007","unstructured":"Wein, R., van den Berg, J.P., Halperin, D.: The Visibility\u2013Voronoi Complex and Its Applications. Computational Geometry\u00a036(1), 66\u201387 (2007)","journal-title":"Computational Geometry"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. In: Proc. Third Annual Symposium on Computational Geometry, pp. 50\u201363 (2005)","DOI":"10.1145\/41958.41964"},{"key":"9_CR5","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035315","volume-title":"Handbook of discrete and Computational Geometry","author":"J.E. Goodman","year":"2004","unstructured":"Goodman, J.E., O\u2019Rourke, J.: Handbook of discrete and Computational Geometry, 2nd edn. CRC Press, Boca Raton, USA (2004)","edition":"2"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Wang, L., Yang, C., Qi, M., Meng, X., Wang, X.: Design of a Walkthrough System for Virtual Museum Based on Voronoi Diagram. In: ISVD 2006. Proc. 3rd International Symposium on Voronoi Diagrams in Science and Engineering, pp. 258\u2013263 (2006)","DOI":"10.1109\/ISVD.2006.20"},{"issue":"1","key":"9_CR7","first-page":"89","volume":"2","author":"X. Meng","year":"2006","unstructured":"Meng, X., Qi, M., Yang, C., Wang, L.: Path Planning in Virtual Museum Based on Polygon\u2019s Voronoi Diagram. Journal of Computational Information Systems\u00a02(1), 89\u201397 (2006)","journal-title":"Journal of Computational Information Systems"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/70.88035","volume":"5","author":"O. Takahashi","year":"1989","unstructured":"Takahashi, O., Schilling, R.J.: Motion planning in a plane using generalized Voronoi diagrams. IEEE Transactions on Robotics and Automation\u00a05(2), 143\u2013150 (1989)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"9_CR9","unstructured":"Blaer, P.S.: Robot Path Planning Using Generalized Voronoi Diagrams, http:\/\/www.cs.columbia.edu\/~pblaer\/projects\/path_planner\/"},{"key":"9_CR10","first-page":"2931","volume-title":"Proc. IEEE Conference on Robotics and Automation","author":"K. Hoff","year":"2000","unstructured":"Hoff, K., Culver, T., Keyser, J., Lin, M., Manocha, D.: Interactive motion planning using hardware accelerated computation of generalized Voronoi diagrams. In: Proc. IEEE Conference on Robotics and Automation, pp. 2931\u20132937. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bhattacharya, P., Gavrilova, M.L.: Voronoi Diagram in Optimal Path Planning. In: The 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD, IEEE-CS Press, Cardiff, UK, July,2007 (2007) (accepted to)","DOI":"10.1109\/ISVD.2007.43"},{"issue":"7","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1360\/jos171561","volume":"17","author":"Y. Cheng-Lei","year":"2006","unstructured":"Cheng-Lei, Y., Jia-Ye, W., Xiang-Xu, M.: Upper Bounds on the Size of Inner Voronoi Diagrams of Multiply Connected Polygons. Journal of Software\u00a017(7), 1527\u20131534 (2006)","journal-title":"Journal of Software"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74472-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:16:08Z","timestamp":1737396968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74472-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744689"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74472-6_9","relation":{},"subject":[]}}