乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T23:45:37Z","timestamp":1705103137548},"reference-count":40,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"National Science Foundation","award":["CCF-1018388"]},{"name":"Metron Aviation"},{"name":"NASA Ames"},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"crossref","award":["1138520"],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Research Funds of the University of Helsinki"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1016\/j.comgeo.2013.12.005","type":"journal-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T07:45:23Z","timestamp":1388735123000},"page":"651-667","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["Minimum-link paths revisited"],"prefix":"10.1016","volume":"47","author":[{"given":"Joseph S.B.","family":"Mitchell","sequence":"first","affiliation":[]},{"given":"Valentin","family":"Polishchuk","sequence":"additional","affiliation":[]},{"given":"Mikko","family":"Sysikaski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.comgeo.2013.12.005_br0010","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S0218195994000045","article-title":"Minimum-link c-oriented paths: Single-source queries","volume":"4","author":"Adegeest","year":"1994","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10.1016\/j.comgeo.2013.12.005_br0020","series-title":"Proceedings of the 23rd Annual Symposium on Computational Geometry","first-page":"327","article-title":"On approximate halfspace range counting and relative epsilon-approximations","author":"Aronov","year":"2007"},{"issue":"1","key":"10.1016\/j.comgeo.2013.12.005_br0030","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01377183","article-title":"Ray shooting in polygons using geodesic triangulations","volume":"12","author":"Chazelle","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/j.comgeo.2013.12.005_br0040","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02187743","article-title":"Quasi-optimal range searching in space of finite vc-dimension","volume":"4","author":"Chazelle","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.comgeo.2013.12.005_br0050","series-title":"Algorithms and Data Structures: 2nd Workshop, WADS '91, Proceedings","first-page":"261","article-title":"Geometric searching and link distance","author":"Das","year":"1991"},{"key":"10.1016\/j.comgeo.2013.12.005_br0060","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0925-7721(91)90010-C","article-title":"On rectilinear link distance","volume":"1","author":"de Berg","year":"1991","journal-title":"Comput. Geom."},{"key":"10.1016\/j.comgeo.2013.12.005_br0070","author":"Demaine"},{"key":"10.1016\/j.comgeo.2013.12.005_br0080","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","article-title":"On a class of O(n2) problems in computational geometry","volume":"5","author":"Gajentaan","year":"1995","journal-title":"Comput. Geom."},{"issue":"1","key":"10.1016\/j.comgeo.2013.12.005_br0090","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0196-6774(91)90024-S","article-title":"Computing the visibility polygon from a convex set and related problems","volume":"12","author":"Ghosh","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/j.comgeo.2013.12.005_br0100","article-title":"Handbook of Discrete and Computational Geometry","author":"Goodman","year":"2004"},{"key":"10.1016\/j.comgeo.2013.12.005_br0110","series-title":"Conquering contours: Efficient algorithms for computational geometry","author":"G\u00fcting","year":"1983"},{"issue":"2","key":"10.1016\/j.comgeo.2013.12.005_br0120","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/S0734-189X(87)80114-7","article-title":"New algorithms for special cases of the hidden line elimination problem","volume":"40","author":"G\u00fcting","year":"1987","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"10.1016\/j.comgeo.2013.12.005_br0130","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","article-title":"Computing minimum length paths of a given homotopy class","volume":"4","author":"Hershberger","year":"1994","journal-title":"Comput. Geom."},{"issue":"3","key":"10.1016\/j.comgeo.2013.12.005_br0140","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1006\/jagm.1995.1017","article-title":"A pedestrian approach to ray shooting: Shoot a ray, take a walk","volume":"18","author":"Hershberger","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/j.comgeo.2013.12.005_br0150","series-title":"Mechanical Movements, Powers and Devices","author":"Hiscox","year":"2007"},{"key":"10.1016\/j.comgeo.2013.12.005_br0160","series-title":"Proceedings of the 25th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"393","article-title":"Dynamic segment intersection search with applications","author":"Imai","year":"1984"},{"issue":"2","key":"10.1016\/j.comgeo.2013.12.005_br0170","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1137\/0215033","article-title":"Efficient algorithms for geometric graph search problems","volume":"15","author":"Imai","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.comgeo.2013.12.005_br0180","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(87)90024-1","article-title":"Dynamic orthogonal segment intersection search","volume":"8","author":"Imai","year":"1987","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"10.1016\/j.comgeo.2013.12.005_br0190","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0925-7721(98)00041-8","article-title":"On the bit complexity of minimum link paths: Superquadratic algorithms for problems solvable in linear time","volume":"12","author":"Kahan","year":"1999","journal-title":"Comput. Geom."},{"issue":"3","key":"10.1016\/j.comgeo.2013.12.005_br0200","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s00454-012-9443-3","article-title":"Simple proofs of classical theorems in discrete geometry via the Guth\u2013Katz polynomial partitioning technique","volume":"48","author":"Kaplan","year":"2012","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.comgeo.2013.12.005_br0210","unstructured":"D.T. Lee, personal communication."},{"key":"10.1016\/j.comgeo.2013.12.005_br0220","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(96)80467-7","article-title":"Rectilinear paths among rectilinear obstacles","volume":"70","author":"Lee","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.comgeo.2013.12.005_br0230","series-title":"Handbook of Computational Geometry","first-page":"519","article-title":"Link distance problems","author":"Maheshwari","year":"2000"},{"key":"10.1016\/j.comgeo.2013.12.005_br0240","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","article-title":"Geometric Discrepancy: An Illustrated Guide","author":"Matou\u0161ek","year":"1999"},{"issue":"1","key":"10.1016\/j.comgeo.2013.12.005_br0250","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BF01758855","article-title":"Minimum-link paths among obstacles in the plane","volume":"8","author":"Mitchell","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/j.comgeo.2013.12.005_br0260","series-title":"Handbook of Computational Geometry","first-page":"633","article-title":"Geometric shortest paths and network optimization","author":"Mitchell","year":"2000"},{"key":"10.1016\/j.comgeo.2013.12.005_br0270","author":"Mitchell"},{"key":"10.1016\/j.comgeo.2013.12.005_br0280","series-title":"Algorithms and Data Structures, 6th International Workshop, WADS '99, Proceedings","first-page":"13","article-title":"Line simplification with restricted orientations","author":"Neyer","year":"1999"},{"key":"10.1016\/j.comgeo.2013.12.005_br0290","series-title":"International Conference on Circuits and Systems","article-title":"Gridless routers \u2013 new wire routing algorithm based on computational geometry","author":"Ohtsuki","year":"1985"},{"key":"10.1016\/j.comgeo.2013.12.005_br0300","series-title":"IEEE International Conference on Computer-Aided Design","first-page":"76","article-title":"Gridless routers for two layer interconnection","author":"Ohtsuki","year":"1984"},{"key":"10.1016\/j.comgeo.2013.12.005_br0310","series-title":"12th International Symposium on Algorithms and Data Structures (WADS)","first-page":"655","article-title":"Faster algorithms for minimum-link paths with restricted orientations","volume":"vol. 6844","author":"Polishchuk","year":"2011"},{"issue":"2","key":"10.1016\/j.comgeo.2013.12.005_br0320","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0890-5401(87)90045-9","article-title":"Optimal computation of finitely oriented convex hulls","volume":"72","author":"Rawlins","year":"1987","journal-title":"Inf. Comput."},{"key":"10.1016\/j.comgeo.2013.12.005_br0330","series-title":"Proceedings of the IEEE International Symposium on Circuits and Systems","first-page":"588","article-title":"A fast line-search method based on a tile plane","author":"Sato","year":"1987"},{"issue":"1","key":"10.1016\/j.comgeo.2013.12.005_br0340","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","article-title":"A linear time algorithm with minimum link paths inside a simple polygon","volume":"35","author":"Suri","year":"1986","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"10.1016\/j.comgeo.2013.12.005_br0350","series-title":"Proceedings of the 2nd Annual Symposium on Computational Geometry","first-page":"14","article-title":"Worst-case optimal algorithms for constructing visibility polygons with holes","author":"Suri","year":"1986"},{"key":"10.1016\/j.comgeo.2013.12.005_br0360","series-title":"Data Structures and Efficient Algorithms","first-page":"233","article-title":"On spanning trees with low crossing numbers","volume":"vol. 594","author":"Welzl","year":"1992"},{"issue":"4","key":"10.1016\/j.comgeo.2013.12.005_br0370","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1137\/0216049","article-title":"On some distance problems in fixed orientations","volume":"16","author":"Widmayer","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.comgeo.2013.12.005_br0380","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1142\/S0218195992000056","article-title":"On bends and lengths of rectilinear paths: a graph theoretic approach","volume":"2","author":"Yang","year":"1992","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"10.1016\/j.comgeo.2013.12.005_br0390","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/12.286304","article-title":"On bends and distances of paths among obstacles in 2-layer interconnection model","volume":"43","author":"Yang","year":"1994","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comgeo.2013.12.005_br0400","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1137\/S0097539792229672","article-title":"Rectilinear paths problems among rectilinear obstacles revisited","volume":"24","author":"Yang","year":"1995","journal-title":"SIAM J. Comput."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772113001739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772113001739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T18:06:55Z","timestamp":1589220415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772113001739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["S0925772113001739"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2013.12.005","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2014,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimum-link paths revisited","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2013.12.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}