{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:37:10Z","timestamp":1649119030343},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf02310534","type":"journal-article","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:21:53Z","timestamp":1139995313000},"page":"203-212","source":"Crossref","is-referenced-by-count":1,"title":["The application of \u03c8-transform for determining a near-optimal path in the presence of polyhedral obstacles"],"prefix":"10.1007","volume":"48","author":[{"given":"D.","family":"Surla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Rackovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02310534_CR1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-Perez","year":"1979","unstructured":"Lozano-Perez, T., Wesley, M. A.: An algorithm for planning collision-free paths among polyhedral obstacles. Comm. ACM22, 560\u2013570 (1979).","journal-title":"Comm. ACM"},{"key":"BF02310534_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. T. Lee","year":"1984","unstructured":"Lee, D. T., Preparata, F. P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks14, 393\u2013410 (1984).","journal-title":"Networks"},{"key":"BF02310534_CR3","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"C. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.: An algorithm for shortest path motion in three dimensions. Inform. Proc. Letters20, 559\u2013563 (1985).","journal-title":"Inform. Proc. Letters"},{"issue":"1","key":"BF02310534_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. SIAM J. Comput.15 (1), 193\u2013215 (1986).","journal-title":"SIAM J. Comput."},{"issue":"1","key":"BF02310534_CR5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/JRA.1986.1087037","volume":"2","author":"E. Wong","year":"1986","unstructured":"Wong, E., Fu, K.: A hierarchical space approach to three-dimension path planning, IEEE J Rob. Autom.RA-2 (1), 42\u201358 (1986).","journal-title":"IEEE J Rob. Autom. RA"},{"key":"BF02310534_CR6","unstructured":"Ashton, J., Hoang, D.: An algorithm for finding optimal paths between points while avoiding polyhedral obstacles. Proc. of the 3rd International Conference on Advanced Robotics1987, 307\u2013312."},{"key":"BF02310534_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. ACM1987, 56\u201365.","DOI":"10.1145\/28395.28402"},{"key":"BF02310534_CR8","doi-asserted-by":"crossref","unstructured":"Bajaj, C.: An efficient parallel solution for Euclidean shortest path in three dimensions. Proc. Rob. Autom.1986, 1897\u20131900.","DOI":"10.1109\/ROBOT.1986.1087478"},{"key":"BF02310534_CR9","unstructured":"Surla, D., Obradovic, D., Konjovic, Z.: Planning of trajectories for the motion of planar mechanisms in the presence of obstacles. The Fourth Internat. Conf. on Computer Graphics, Dubrovnik, 1990 (to appear)."},{"key":"BF02310534_CR10","unstructured":"Surla, D., Rackovic, M.: An algorithm for determing shortest distance between two points a planar containing obstacles. The Fourth Internat. Conf. on Computer Graphics, Dubrovnik, 1990, (to appear)."},{"issue":"12","key":"BF02310534_CR11","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","volume":"33","author":"D. T. Lee","year":"1984","unstructured":"Lee, D. T., Preparate, F. P.: computational geometry\u2014A survey. IEEE Transactions On ComputersC-33 (12), 1072\u20131101 (1984).","journal-title":"IEEE Transactions On Computers C"},{"key":"BF02310534_CR12","volume-title":"\u0420\u0435\u0448\u0435\u043d\u0438\u0435 \u043d\u0435\u0432\u0439\u0434\u043f\u043a\u043b\u0439\u0445 \u043d\u0435\u043b\u0438\u043d\u0435\u0439\u043d\u044b\u0445 \u0437\u0430\u0434\u0430\u0447 \u043e\u043f\u0442\u0438\u043c\u0438\u0437\u0430\u0446\u0438\u0438","author":"\u0412. \u041a. \u0427\u0438\u0447\u0438\u043d\u0430\u0434\u0437\u0435","year":"1983","unstructured":"\u0427\u0438\u0447\u0438\u043d\u0430\u0434\u0437\u0435, \u0412. \u041a.: \u0420\u0435\u0448\u0435\u043d\u0438\u0435 \u043d\u0435\u0432\u0439\u0434\u043f\u043a\u043b\u0439\u0445 \u043d\u0435\u043b\u0438\u043d\u0435\u0439\u043d\u044b\u0445 \u0437\u0430\u0434\u0430\u0447 \u043e\u043f\u0442\u0438\u043c\u0438\u0437\u0430\u0446\u0438\u0438. \u041c\u043e\u0441\u043a\u0432\u0430 \u201c\u041d\u0430\u0443\u043a\u0430\u201d. 1983."},{"issue":"1\u20132","key":"BF02310534_CR13","first-page":"A.19","volume":"29","author":"D. Surla","year":"1988","unstructured":"Surla, D., Jerinic, Lj: An algorithm for determining the relation between a straight line (point) and a simple polyhedron. Automatika29, (1\u20132), A.19-A.29 (1988).","journal-title":"Automatika"},{"key":"BF02310534_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry, monograph","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F. P., Shamos, M. I.: Computational geometry, monograph. Berlin, Heidelberg, New York: Springer 1985."},{"key":"BF02310534_CR15","first-page":"49","volume":"1","author":"D. Surla","year":"1990","unstructured":"Surla, D., Budimac, Z., Detection of the intersection of two simple polyhedra. Informatica1, 49\u201354 (1990).","journal-title":"Informatica"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02310534.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02310534\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02310534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:11:56Z","timestamp":1558026716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02310534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF02310534"],"URL":"https:\/\/doi.org\/10.1007\/bf02310534","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}