乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:24:06Z","timestamp":1720625046693},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3100,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1016\/j.entcs.2004.06.033","type":"journal-article","created":{"date-parts":[[2005,2,11]],"date-time":"2005-02-11T14:16:45Z","timestamp":1108131405000},"page":"45-57","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths"],"prefix":"10.1016","volume":"120","author":[{"given":"Arthur W.","family":"Chou","sequence":"first","affiliation":[]},{"given":"Ker-I","family":"Ko","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2004.06.033_bib001","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1137\/S009753979325456X","article-title":"Computational complexity of two-dimensional regions","volume":"24","author":"Chou","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.entcs.2004.06.033_bib002","unstructured":"Chou, A.W. and Ko, K., On the complexity of finding paths in a two-dimensional domain I: shortest paths, Math. Logic Quarterly, to appear; also in Proc. International Conference on Computability and Complexity in Analysis, 2003, Informatik Berichte 302-8\/2003, FernUniversit\u00e4t in Hagen, Hagen, Germany"},{"key":"10.1016\/j.entcs.2004.06.033_bib003","unstructured":"Chou, A.W. and Ko, K., A note on the complexity of distance functions of two-dimensional domains, preprint"},{"key":"10.1016\/j.entcs.2004.06.033_bib004","series-title":"Theory of Computational Complexity","author":"Du","year":"2000"},{"key":"10.1016\/j.entcs.2004.06.033_bib005","series-title":"Proceedings of the 2nd ACM Symposium on Computational Geometry","first-page":"1","article-title":"Linear time algorithms for visibility and shortest path problems inside simple polygons","author":"Guibas","year":"1986"},{"key":"10.1016\/j.entcs.2004.06.033_bib006","series-title":"Proceedings of the 3rd ACM Symposium on Computational Geometry","first-page":"50","article-title":"Optimal shortest path queries in a simple polygon","author":"Guibas","year":"1987"},{"key":"10.1016\/j.entcs.2004.06.033_bib007","volume":"Vol. 1\u20133","author":"Henrici","year":"1974-1977-1986"},{"key":"10.1016\/j.entcs.2004.06.033_bib008","series-title":"Planning, Geometry, and Complexity of Robot Motion","author":"Hopcroft","year":"1987"},{"key":"10.1016\/j.entcs.2004.06.033_bib009","series-title":"Complexity Theory of Real Functions","author":"Ko","year":"1991"},{"key":"10.1016\/j.entcs.2004.06.033_bib010","series-title":"Handbook of Recursive Mathematics, Vol. 2: Recursive Algebra, Analysis and Combinatorics","first-page":"1271","article-title":"Polynomial-time computability in analysis","volume":"Vol. 139","author":"Ko","year":"1998"},{"key":"10.1016\/j.entcs.2004.06.033_bib011","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","article-title":"Computational complexity of real functions","volume":"20","author":"Ko","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.entcs.2004.06.033_bib012","doi-asserted-by":"crossref","unstructured":"Mitchell, J. and Sharir, M., New results on shortest paths in three dimensions, Proc. 20th ACM Symposium on Computational Geometry, ACM, NY, 2004 (to appear)","DOI":"10.1145\/997817.997839"},{"key":"10.1016\/j.entcs.2004.06.033_bib013","series-title":"Computability in Analysis and Physics","author":"Pour-El","year":"1989"},{"key":"10.1016\/j.entcs.2004.06.033_bib014","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/JRA.1987.1087092","article-title":"Minimizing turns for discrete movement in the interior of a polygon","volume":"3","author":"Reif","year":"1987","journal-title":"IEEE J. Robot. Autom."},{"key":"10.1016\/j.entcs.2004.06.033_bib015","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","article-title":"On minimal node-cost planar embeddings","volume":"14","author":"Storer","year":"1984","journal-title":"Networks"},{"key":"10.1016\/j.entcs.2004.06.033_bib016","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","article-title":"A linear time algorithm for minimum link path in a simple polygon","volume":"35","author":"Suri","year":"1986","journal-title":"Comput. Vision, Graphics, Image Proc."},{"key":"10.1016\/j.entcs.2004.06.033_bib017","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","article-title":"On embedding a graph in the grid with the minimum number of bends","volume":"16","author":"Tamassia","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.entcs.2004.06.033_bib018","series-title":"Computable Analysis","author":"Weihrauch","year":"2000"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610500006X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610500006X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T18:29:56Z","timestamp":1548700196000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610500006X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":18,"alternative-id":["S157106610500006X"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2004.06.033","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}