{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:51:50Z","timestamp":1648896710576},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,2,5]],"date-time":"2008-02-05T00:00:00Z","timestamp":1202169600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00454-007-9025-y","type":"journal-article","created":{"date-parts":[[2008,2,4]],"date-time":"2008-02-04T14:28:38Z","timestamp":1202135318000},"page":"377-394","source":"Crossref","is-referenced-by-count":3,"title":["Tight Bounds for Connecting Sites Across Barriers"],"prefix":"10.1007","volume":"40","author":[{"given":"David","family":"Krumme","sequence":"first","affiliation":[]},{"given":"Eynat","family":"Rafalin","sequence":"additional","affiliation":[]},{"given":"Diane L.","family":"Souvaine","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,2,5]]},"reference":[{"issue":"4","key":"9025_CR1","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s00454-003-2853-5","volume":"30","author":"T. Asano","year":"2003","unstructured":"Asano, T., de Berg, M., Cheong, O., Guibas, L.J., Snoeyink, J., Tamaki, H.: Spanning trees crossing few barriers. Discrete Comput. Geom. 30(4), 591\u2013606 (2003)","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"9025_CR2","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02187743","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4(5), 467\u2013489 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9025_CR3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1983","unstructured":"Edelsbrunner, H., Guibas, L., Stolfi, J.: Optimal point location in a monotone subdivision. SIAM J. Comput. 15(2), 317\u2013340 (1983)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9025_CR4","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L.J. Guibas","year":"1985","unstructured":"Guibas, L.J., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph. 4(2), 74\u2013123 (1985)","journal-title":"ACM Trans. Graph."},{"key":"9025_CR5","unstructured":"Hoffmann, M., T\u00f3th, Cs.D.: Connecting points in the presence of obstacles in the plane. In: Proc. 14th Canad. Conf. on Comput. Geom., pp.\u00a063\u201367, 2002"},{"key":"9025_CR6","unstructured":"Hoffmann, M., T\u00f3th, Cs.D.: Spanning trees across axis-parallel segments. In: Proc. 18th Canadian Conf. on Comput. Geom., pp.\u00a0101\u2013104, 2006"},{"issue":"1","key":"9025_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D.G. 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":"9025_CR8","doi-asserted-by":"crossref","unstructured":"Krumme, D., Perkins, G., Rafalin, E., Souvaine, D.L.: Upper and lower bounds for connecting sites across barriers. TUFTS-CS Technical Report 2003-6, Tufts University, Medford, MA (2003)","DOI":"10.1145\/1137856.1137920"},{"issue":"2","key":"9025_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1051\/ita\/1991250201031","volume":"25","author":"J. Matou\u0161ek","year":"1991","unstructured":"Matou\u0161ek, J.: Spanning trees with low crossing number. RAIRO Inform. Th\u00e9or. Appl. 25(2), 103\u2013123 (1991)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"9025_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Efficient partition trees. Discrete Comput. Geom. 8, 315\u2013334 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"7","key":"9025_CR11","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.: Planar point location using persistent search trees. Commun. ACM 29(7), 669\u2013679 (1986)","journal-title":"Commun. ACM"},{"key":"9025_CR12","unstructured":"Snoeyink, J.: Open problem presented at the 9th Canadian Conference on Computational Geometry, 1997"},{"key":"9025_CR13","series-title":"Lecture Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/3-540-63397-9_35","volume-title":"Proc. 5th European Sympos. on Algorithms","author":"J. Snoeyink","year":"1997","unstructured":"Snoeyink, J., van Kreveld, M.: Linear-time reconstruction of Delaunay triangulations with applications. In: Proc. 5th European Sympos. on Algorithms. Lecture Notes in Comp. Sci., vol. 1284, pp. 459\u2013471. Springer, Berlin (1997)"},{"key":"9025_CR14","first-page":"23","volume-title":"Proc. 4th Sympos. on Comput. Geom.","author":"E. Welzl","year":"1988","unstructured":"Welzl, E.: Partition trees for triangle counting and other range searching problems. In: Proc. 4th Sympos. on Comput. Geom., pp. 23\u201333. ACM Press, New York (1988)"},{"key":"9025_CR15","series-title":"Lecture Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-55488-2_30","volume-title":"Data Structures And Efficient Algorithms","author":"E. Welzl","year":"1992","unstructured":"Welzl, E.: On spanning trees with low crossing numbers. In: Data Structures And Efficient Algorithms. Lecture Notes in Comp. Sci., vol. 594, pp. 233\u2013249. Springer, Berlin (1992)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9025-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-007-9025-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9025-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:34Z","timestamp":1559072854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-007-9025-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9025"],"URL":"https:\/\/doi.org\/10.1007\/s00454-007-9025-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,5]]}}}