乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:33:49Z","timestamp":1726410829854},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_48","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"646-658","source":"Crossref","is-referenced-by-count":0,"title":["Computing a Geodesic Two-Center of Points in a Simple Polygon"],"prefix":"10.1007","author":[{"given":"Eunjin","family":"Oh","sequence":"first","affiliation":[]},{"given":"Sang Won","family":"Bae","sequence":"additional","affiliation":[]},{"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"48_CR1","unstructured":"Ahn, H.K., Barba, L., Bose, P., De Carufel, J.L., Korman, M., Oh, E.: A linear-time algorithm for the geodesic center of a simple polygon. In: Proceedings of the 31st Symposium Computational Geometry (SoCG), vol. 34, pp. 209\u2013223 (2015)"},{"issue":"1","key":"48_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02189321","volume":"9","author":"B Aronov","year":"1993","unstructured":"Aronov, B., Fortune, S., Wilfong, G.: The furthest-site geodesic voronoi diagram. Discrete Comput. Geom. 9(1), 217\u2013255 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"48_CR3","unstructured":"Asano, T., Toussaint, G.T.: Computing geodesic center of a simple polygon. Technical report SOCS-85.32, McGill University (1985)"},{"issue":"3","key":"48_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"TM Chan","year":"1999","unstructured":"Chan, T.M.: More planar two-center algorithms. Comput. Geom. 13(3), 189\u2013198 (1999)","journal-title":"Comput. Geom."},{"issue":"3","key":"48_CR5","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B Chazelle","year":"1996","unstructured":"Chazelle, B., Matou\u0161ek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21(3), 579\u2013597 (1996)","journal-title":"J. Algorithms"},{"issue":"4","key":"48_CR6","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R Cole","year":"1988","unstructured":"Cole, R.: Parallel merge sort. SIAM J. Comput. 17(4), 770\u2013785 (1988)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"48_CR7","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"ME Dyer","year":"1986","unstructured":"Dyer, M.E.: On a multidimensional search technique and its application to the euclidean one-centre problem. SIAM J. Comput. 15(3), 725\u2013738 (1986)","journal-title":"SIAM J. Comput."},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th ACM Symposium Theory Computing (STOC), pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"issue":"1\u20134","key":"48_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(1\u20134), 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"1","key":"48_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/jagm.2001.1194","volume":"42","author":"D Halperin","year":"2002","unstructured":"Halperin, D., Sharir, M., Goldberg, K.Y.: The 2-center problem with obstacles. J. Algorithms 42(1), 109\u2013134 (2002)","journal-title":"J. Algorithms"},{"issue":"1","key":"48_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01185335","volume":"9","author":"R Hwang","year":"1993","unstructured":"Hwang, R., Lee, R., Chang, R.: The slab dividing approach to solve the Euclidean \n \n \n \n $$p$$\n \n \n p\n \n \n -center problem. Algorithmica 9(1), 1\u201322 (1993)","journal-title":"Algorithmica"},{"issue":"4","key":"48_CR12","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in \n \n \n \n $$R^3$$\n \n \n \n R\n 3\n \n \n \n and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"48_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-48971-0_27","volume-title":"Algorithms and Computation","author":"E Oh","year":"2015","unstructured":"Oh, E., De Carufel, J.-L., Ahn, H.-K.: The 2-center problem in a simple polygon. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 307\u2013317. Springer, Heidelberg (2015). doi:\n 10.1007\/978-3-662-48971-0_27"},{"issue":"1","key":"48_CR14","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/BF02187751","volume":"4","author":"R Pollack","year":"1989","unstructured":"Pollack, R., Sharir, M., Rote, G.: Computing the geodesic center of a simple polygon. Discrete Comput. Geom. 4(1), 611\u2013626 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"48_CR15","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, 9\u201342 (1989)","journal-title":"Revue D\u2019Intelligence Artificielle"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:35:05Z","timestamp":1559421305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}