{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:39:03Z","timestamp":1649108343620},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Visual Languages & Computing"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/s1045-926x(05)80027-8","type":"journal-article","created":{"date-parts":[[2006,12,20]],"date-time":"2006-12-20T15:12:23Z","timestamp":1166627543000},"page":"143-162","source":"Crossref","is-referenced-by-count":1,"title":["Visual reply to map-related queries"],"prefix":"10.1016","volume":"2","author":[{"given":"Peter D.","family":"Holmes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1045-926X(05)80027-8_bib1","author":"Burrough","year":"1986"},{"key":"10.1016\/S1045-926X(05)80027-8_bib2","series-title":"Geometric Reasoning","article-title":"An algorithmic approach to some problems in terrain navigation","author":"Mitchell","year":"1989"},{"key":"10.1016\/S1045-926X(05)80027-8_bib3","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/TSMC.1981.4308589","article-title":"Automatic planning of manipulator transfer movements","volume":"SMC-11","author":"Lozano-Perez","year":"1981","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/S1045-926X(05)80027-8_bib4","author":"O'Rourke","year":"1987"},{"key":"10.1016\/S1045-926X(05)80027-8_bib5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","article-title":"Visibility of disjoint polygons","volume":"1","author":"Asano","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/S1045-926X(05)80027-8_bib6","author":"Pavlidis","year":"1982"},{"key":"10.1016\/S1045-926X(05)80027-8_bib7","author":"Foley","year":"1982"},{"key":"10.1016\/S1045-926X(05)80027-8_bib8","first-page":"265","article-title":"Bandwidth compression of a television signal","volume":"104B","author":"Gouriet","year":"1957"},{"key":"10.1016\/S1045-926X(05)80027-8_bib9","series-title":"Proceedings of the IEEE Workshop on Languages for Automation","first-page":"66","article-title":"Run length code as an object-oriented spatial data structure","author":"Jungert","year":"1986"},{"key":"10.1016\/S1045-926X(05)80027-8_bib10","first-page":"344","article-title":"Automatic operation for a robot lawn mower","volume":"727","author":"Huang","year":"1986","journal-title":"SPIE Mobile Robots"},{"key":"10.1016\/S1045-926X(05)80027-8_bib11","author":"Preparata","year":"1985"},{"key":"10.1016\/S1045-926X(05)80027-8_bib12","series-title":"Proceedings of the International Conference on Intelligent Autonomous Systems","first-page":"590","article-title":"Shortest path solves translation separability of polygons","author":"Toussaint","year":"1986"},{"key":"10.1016\/S1045-926X(05)80027-8_bib13","article-title":"A note on the algorithmic complexity of finding shortest paths within tile-based data structures","author":"Holmes","year":"1990","journal-title":"FAO report D 30560-3.4"},{"key":"10.1016\/S1045-926X(05)80027-8_bib14","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","article-title":"Euclidean shortest paths in the presence of rectilinear barriers","volume":"14","author":"Lee","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S1045-926X(05)80027-8_bib15","first-page":"238","article-title":"Shortest paths in a digitized map using a tile-based data structure","volume":"Vol. 1","author":"Holmes","year":"1988"},{"key":"10.1016\/S1045-926X(05)80027-8_bib16","author":"Nilsson","year":"1979"},{"key":"10.1016\/S1045-926X(05)80027-8_bib17","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S1045-926X(05)80027-8_bib18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","article-title":"Constructing the visibility graph for n-line segments in O(n2) time","volume":"20","author":"Welzl","year":"1985","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1045-926X(05)80027-8_bib19","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0196-6774(87)90038-1","article-title":"An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers","volume":"8","author":"Leven","year":"1987","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S1045-926X(05)80027-8_bib20","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/JRA.1986.1087030","article-title":"Reachable grasps on a polygon: the convex rope algorithm","volume":"RA-2","author":"Peshkin","year":"1986","journal-title":"IEEE Journal of Robotics and Automation"},{"key":"10.1016\/S1045-926X(05)80027-8_bib21","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S1045-926X(05)80027-8_bib22","series-title":"Proceedings of the International Conference on Intelligent Autonomous Systems","first-page":"634","article-title":"Collision avoidance and path finding through constrained distance transformation in robot state space","author":"Verbeek","year":"1986"},{"key":"10.1016\/S1045-926X(05)80027-8_bib23","series-title":"Signal Processing III: Theories and Applications","article-title":"The constrained distance transformation: a pseudoeuclidean recursive implementation of the Lee-algorithm","author":"Dorst","year":"1986"},{"key":"10.1016\/S1045-926X(05)80027-8_bib24","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/34.19041","article-title":"An efficient uniform cost algorithm applied to distance transforms","volume":"11","author":"Verwer","year":"1989","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S1045-926X(05)80027-8_bib25","series-title":"Proceedings of the IEEE Workshop on Visual Languages","first-page":"248","article-title":"A knowledge-based approach to the shortest path problem in a digitized map","author":"Jungert","year":"1988"},{"key":"10.1016\/S1045-926X(05)80027-8_bib26","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1117\/12.948963","article-title":"Heuristic traversal of a free space graph","volume":"1003","author":"Holmes","year":"1988","journal-title":"SPIE, Sensor Fusion: Spatial Reasoning and Scene Interpretation"},{"key":"10.1016\/S1045-926X(05)80027-8_bib27","article-title":"Using connectivity graphs for path planning in digitized maps","author":"Holmes","year":"1990","journal-title":"FOA report C 30572-3.4"},{"key":"10.1016\/S1045-926X(05)80027-8_bib28","series-title":"Proceedings of the Second International Conference on Intelligent Autonomous Systems","first-page":"230","article-title":"A hierarchical knowledge structure for heuristic path planning","author":"Jungert","year":"1989"},{"key":"10.1016\/S1045-926X(05)80027-8_bib29","series-title":"Proceedings of the IEEE Workshop on Visual Languages","first-page":"92","article-title":"Visual reply to map-related queries\u2014a free space graph approach","author":"Holmes","year":"1989"}],"container-title":["Journal of Visual Languages & Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1045926X05800278?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1045926X05800278?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T18:27:15Z","timestamp":1547144835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1045926X05800278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["S1045926X05800278"],"URL":"https:\/\/doi.org\/10.1016\/s1045-926x(05)80027-8","relation":{},"ISSN":["1045-926X"],"issn-type":[{"value":"1045-926X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}