{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:32Z","timestamp":1742913572265,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319286778"},{"type":"electronic","value":"9783319286785"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-28678-5_5","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T10:14:18Z","timestamp":1452248058000},"page":"56-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon"],"prefix":"10.1007","author":[{"given":"Ahmad","family":"Biniaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"issue":"2\u20133","key":"5_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(99)00042-6","volume":"93","author":"M Abellanas","year":"1999","unstructured":"Abellanas, M., Garcia-Lopez, J., Hern\u00e1ndez-Pe\u00f1alver, G., Noy, M., Ramos, P.A.: Bipartite embeddings of trees in the plane. Discrete Appl. Math. 93(2\u20133), 141\u2013148 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"5_CR2","first-page":"75","volume":"12","author":"O Aichholzer","year":"2010","unstructured":"Aichholzer, O., Cabello, S., Monroy, R.F., Flores-Pe\u00f1aloza, D., Hackl, T., Huemer, C., Hurtado, F., Wood, D.R.: Edge-removal and non-crossing configurations in geometric graphs. Discrete Math. Theor. Comput. Sci. 12(1), 75\u201386 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-45030-3_2","volume-title":"Algorithms and Computation","author":"O Aichholzer","year":"2013","unstructured":"Aichholzer, O., Hackl, T., Korman, M., Pilz, A., Vogtenhuber, B.: Geodesic-preserving polygon simplification. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 11\u201321. Springer, Heidelberg (2013)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-21840-3_6","volume-title":"Algorithms and Data Structures","author":"A Biniaz","year":"2015","unstructured":"Biniaz, A., Maheshwari, A., Nandy, S.C., Smid, M.: An optimal algorithm for plane matchings in multipartite geometric graphs. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 66\u201378. Springer, Heidelberg (2015)"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s00454-006-1287-2","volume":"37","author":"P Bose","year":"2007","unstructured":"Bose, P., Demaine, E.D., Hurtado, F., Iacono, J., Langerman, S., Morin, P.: Geodesic ham-sandwich cuts. Discrete Comput. Geom. 37(3), 325\u2013339 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"LJ Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-46515-7_13","volume-title":"Discrete and Computational Geometry","author":"A Kaneko","year":"2000","unstructured":"Kaneko, A.: On the maximum degree of bipartite embeddings of trees in the plane. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 166\u2013171. Springer, Heidelberg (2000)"},{"key":"5_CR8","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-642-55566-4_25","volume-title":"Discrete and Computational Geometry","author":"A Kaneko","year":"2003","unstructured":"Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane\u2014a survey. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry. Algorithms and Combinatorics, pp. 551\u2013570. Springer, Heidelberg (2003)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-3-319-13287-7_9","volume-title":"Discrete and Computational Geometry and Graphs","author":"M Kano","year":"2014","unstructured":"Kano, M., Suzuki, K., Uno, M.: Properly colored geometric matchings and 3-trees without crossings on multicolored points in the plane. In: Akiyama, J., Ito, H., Sakai, T. (eds.) JCDCGG 2013. LNCS, vol. 8845, pp. 96\u2013111. Springer, Heidelberg (2014)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"5_CR11","first-page":"6","volume":"2","author":"D Sitton","year":"1996","unstructured":"Sitton, D.: Maximum matchings in complete multipartite graphs. Furman Univ. Electron. J. Undergraduate Math. 2, 6\u201316 (1996)","journal-title":"Furman Univ. Electron. J. Undergraduate Math."},{"issue":"2","key":"5_CR12","first-page":"9","volume":"3","author":"GT Toussaint","year":"1989","unstructured":"Toussaint, G.T.: Computing geodesic properties inside a simple polygon. Revue D\u2019Intelligence Artificielle 3(2), 9\u201342 (1989)","journal-title":"Revue D\u2019Intelligence Artificielle"}],"container-title":["Lecture Notes in Computer Science","Topics in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28678-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:04:37Z","timestamp":1578427477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28678-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319286778","9783319286785"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28678-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}