{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:08:13Z","timestamp":1778688493033,"version":"3.51.4"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,12,22]],"date-time":"1999-12-22T00:00:00Z","timestamp":945820800000},"content-version":"vor","delay-in-days":1726,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-91-22103"],"award-info":[{"award-number":["CCR-91-22103"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-9215219"],"award-info":[{"award-number":["CCR-9215219"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009224","name":"Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["IRI-9306544"],"award-info":[{"award-number":["IRI-9306544"]}],"id":[{"id":"10.13039\/100009224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001736","name":"German-Israeli Foundation for Scientific Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001736","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1016\/0304-3975(94)00237-d","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"301-317","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Reaching a goal with directional uncertainty"],"prefix":"10.1016","volume":"140","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas","family":"Guibas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Overmars","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Otfried","family":"Schwarzkopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monique","family":"Teillaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00237-D_BIB1","series-title":"Proc. 5th Ann. ACM Symp. Comput. Geom.","first-page":"247","article-title":"Determining sector visibility of a polygon","author":"Bhattacharya","year":"1989"},{"key":"10.1016\/0304-3975(94)00237-D_BIB2","series-title":"Proc. 5th Ann. ACM Symp. Comput. Geom.","first-page":"187","article-title":"An efficient algorithm for one-step planar compliant motion planning with uncertainty","author":"Briggs","year":"1989"},{"key":"10.1016\/0304-3975(94)00237-D_BIB3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01840394","article-title":"The complexity of planar compliant motion planning under uncertainty","volume":"5","author":"Donald","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(94)00237-D_BIB4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02187784","article-title":"The complexity and construction of many faces in arrangements of lines and of segments","volume":"5","author":"Edelsbrunner","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0304-3975(94)00237-D_BIB5","series-title":"Proc. 24th Ann. IEEE Symp. Found. Comput. Sci.","first-page":"91","article-title":"Constructing arrangements of lines and hyperplanes with applications","author":"Edelsbrunner","year":"1983"},{"key":"10.1016\/0304-3975(94)00237-D_BIB6","series-title":"Computational Geometry","first-page":"35","article-title":"Graphics in flatland: A case study","volume":"Vol. 1","author":"Edelsbrunner","year":"1983"},{"key":"10.1016\/0304-3975(94)00237-D_BIB7","article-title":"On motion planning with uncertainty","author":"Erdmann","year":"1984"},{"key":"10.1016\/0304-3975(94)00237-D_BIB8","series-title":"Proc. 5th Ann. ACM Symp. Comput. Geom.","first-page":"175","article-title":"Compliant motion in a simple polygon","author":"Friedman","year":"1989"},{"key":"10.1016\/0304-3975(94)00237-D_BIB9","series-title":"Proc. 2nd Scand. Workshop Algorithm Theory","first-page":"225","article-title":"Input-sensitive compliant motion in the plane","volume":"Vol. 447","author":"Friedman","year":"1990"},{"key":"10.1016\/0304-3975(94)00237-D_BIB10","article-title":"Simulating Global Illumination Using Adaptive Meshing","author":"Heckbert","year":"1991"},{"key":"10.1016\/0304-3975(94)00237-D_BIB11","series-title":"Third Eurographics Workshop on Rendering","first-page":"203","article-title":"Discontinuity meshing for radiosity","author":"Heckbert","year":"1992"},{"key":"10.1016\/0304-3975(94)00237-D_BIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","article-title":"On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles","volume":"1","author":"Kedem","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0304-3975(94)00237-D_BIB13","series-title":"Robot Motion Planning","author":"Latombe","year":"1991"},{"key":"10.1016\/0304-3975(94)00237-D_BIB14","unstructured":"A. Lazanas and J. Latombe, Landmark-based robot navigation, Algorithmica, submitted."},{"issue":"1","key":"10.1016\/0304-3975(94)00237-D_BIB15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1177\/027836498400300101","article-title":"Automatic synthesis of fine-motion strategies for robots","volume":"3","author":"Lozano-P\u00e9rez","year":"1984","journal-title":"Internat. J. Robot. Res."},{"key":"10.1016\/0304-3975(94)00237-D_BIB16","series-title":"Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci.","first-page":"49","article-title":"Fat triangles determine linearlymany holes","author":"Matous\u0306ek","year":"1991"},{"key":"10.1016\/0304-3975(94)00237-D_BIB17","series-title":"Efficient randomized algorithm for constructing the union of fat triangles and of pseudodiscs","author":"Miller","year":"1993"},{"key":"10.1016\/0304-3975(94)00237-D_BIB18","series-title":"Proc. 3rd Workshop Algorithms Data Struct.","first-page":"452","article-title":"On fat partitioning, fat covering, and the union size of polygons","volume":"Vol. 709","author":"van Kreveld","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400237D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400237D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T15:11:15Z","timestamp":1778685075000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400237D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["030439759400237D"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00237-d","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reaching a goal with directional uncertainty","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(94)00237-D","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}