{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:18:17Z","timestamp":1772205497248,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,4,1]],"date-time":"1987-04-01T00:00:00Z","timestamp":544233600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1987,4]]},"DOI":"10.1016\/0020-0190(87)90091-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"41-50","source":"Crossref","is-referenced-by-count":45,"title":["Obstacle growing in a nonpolygonal world"],"prefix":"10.1016","volume":"25","author":[{"given":"Jean-Paul","family":"Laumond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/0020-0190(87)90091-3_BIB1","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","article-title":"An optimal algorithm for determining the visibility of a polygon from an edge","volume":"30","author":"Avis","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(87)90091-3_BIB2","series-title":"Euclidian Geometry and Convexity","author":"Benson","year":"1966"},{"key":"10.1016\/0020-0190(87)90091-3_BIB3","article-title":"De la perception \u00e0 l'action en robotique d'assemblage: contribution \u00e0 la mod\u00e9lisation et \u00e0 l'algorithmique de base","author":"Gouz\u00e8nes","year":"1984"},{"key":"10.1016\/0020-0190(87)90091-3_BIB4","article-title":"Espace constraint dans l'environnement d'un robot mobile","author":"Laumond","year":"1985","journal-title":"Tech. Rept. LAAS 85250"},{"key":"10.1016\/0020-0190(87)90091-3_BIB5","article-title":"Collision-free path finding without maneuver for a non-holonomic mobile robot","author":"Laumond","year":"1987","journal-title":"Tech. Rept. LAAS 87025"},{"issue":"10","key":"10.1016\/0020-0190(87)90091-3_BIB6","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacle","volume":"22","author":"Lozano-Perez","year":"1979","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0020-0190(87)90091-3_BIB7","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","article-title":"Spatial planning: A configuration space approach","volume":"32","author":"Lozano-Perez","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(87)90091-3_BIB8","series-title":"El\u00e9ments pour une Th\u00e9orie des Milieux Poreux","author":"Matheron","year":"1967"},{"key":"10.1016\/0020-0190(87)90091-3_BIB9","article-title":"Data Structures and Algorithms","author":"Mehlhorn","year":"1984"},{"issue":"10","key":"10.1016\/0020-0190(87)90091-3_BIB10","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","article-title":"Plane sweep algorithms for intersecting geometric figures","volume":"25","author":"Nievergelt","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(87)90091-3_BIB11","series-title":"Proc. 1st IJCAI","first-page":"509","article-title":"A mobile automaton: An application of artificial intelligence techniques","author":"Nilsson","year":"1969"},{"key":"10.1016\/0020-0190(87)90091-3_BIB12","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0020-0190(87)90091-3_BIB13","series-title":"Image Analysis and Mathematical Morphology","author":"Serra","year":"1982"},{"key":"10.1016\/0020-0190(87)90091-3_BIB14","article-title":"Collision detection and avoidance in computer controlled manipulators","author":"Udupa","year":"1977"},{"issue":"4","key":"10.1016\/0020-0190(87)90091-3_BIB15","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":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90091-3_BIB16","article-title":"An O(n2) shortest path algorithm for a nonrotating convex body","author":"Hershberger","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900913?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900913?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:53:41Z","timestamp":1553594021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087900913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,4]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,4]]}},"alternative-id":["0020019087900913"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90091-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,4]]}}}