{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T15:48:16Z","timestamp":1743436096142},"reference-count":21,"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":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6682,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1016\/0304-3975(94)00191-k","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"205-230","source":"Crossref","is-referenced-by-count":7,"title":["An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles"],"prefix":"10.1016","volume":"140","author":[{"given":"Abhi","family":"Dattasharma","sequence":"first","affiliation":[]},{"given":"S.Sathiya","family":"Keerthi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00191-K_BIB1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi diagrams \u2014 A survey of a fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(94)00191-K_BIB2","first-page":"159","article-title":"Algorithm for computing d-dimensional Voronoi diagram and their Duals","volume":"I","author":"Avis","year":"1983","journal-title":"Adv. Comput. Res."},{"issue":"3","key":"10.1016\/0304-3975(94)00191-K_BIB3","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TSMC.1983.6313112","article-title":"Solving the find-path problem by good representation of free space","volume":"13","author":"Brooks","year":"1983","journal-title":"IEEE Trans Systems Man Cyb."},{"key":"10.1016\/0304-3975(94)00191-K_BIB4","series-title":"Proc. IEEE Internat. Conf. Robotics Auto.","article-title":"A Voronoi method for the Piano mover's problem","author":"Canny","year":"1985"},{"key":"10.1016\/0304-3975(94)00191-K_BIB5","series-title":"The Complexity of Robot Motion Planning","author":"Canny","year":"1988"},{"key":"10.1016\/0304-3975(94)00191-K_BIB6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02187909","article-title":"Simplified Voronoi diagrams","volume":"3","author":"Canny","year":"1988","journal-title":"Discrete Comput. Geo."},{"key":"10.1016\/0304-3975(94)00191-K_BIB7","series-title":"Proc. 32nd FOCS","first-page":"29","article-title":"An optimal convexhull algorithm and new results on cuttings","author":"Chazelle","year":"1991"},{"key":"10.1016\/0304-3975(94)00191-K_BIB8","article-title":"Structure and computation of a class of piecewise linear generalized Voronoi diagrams with application to translational motion planning","author":"Dattasharma","year":"1994"},{"key":"10.1016\/0304-3975(94)00191-K_BIB9","article-title":"Generalized Voronoi diagram and geometric searching","author":"Drysdale","year":"1979"},{"key":"10.1016\/0304-3975(94)00191-K_BIB10","series-title":"Proc. IEEE Conf. on Decision and Control","article-title":"Transversality theorem: A useful tool for establishing genericity","author":"Keerthi","year":"1992"},{"key":"10.1016\/0304-3975(94)00191-K_BIB11","series-title":"Proc. 20th Symp. on FOCS","first-page":"18","article-title":"Efficient computation of continuous skeletons","author":"Kirkpatrick","year":"1979"},{"key":"10.1016\/0304-3975(94)00191-K_BIB12","series-title":"Robot Motion Planning","author":"Latombe","year":"1991"},{"key":"10.1016\/0304-3975(94)00191-K_BIB13","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187867","article-title":"Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geo."},{"key":"10.1016\/0304-3975(94)00191-K_BIB14","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Meggido","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00191-K_BIB15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01840348","article-title":"Generalized Voronoi diagrams for a ladder: II. efficient construction of the diagram","volume":"2","author":"D\u00fanlaing","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(94)00191-K_BIB16","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1109\/70.97883","article-title":"A \u2018retraction\u2019 method for learned navigation in unknown terrains for a circular robot","volume":"7","author":"Rao","year":"1991","journal-title":"IEEE Trans. Robotics Automation"},{"key":"10.1016\/0304-3975(94)00191-K_BIB17","unstructured":"A. Sanderson, RPI, Troy, New York, personal communication."},{"key":"10.1016\/0304-3975(94)00191-K_BIB18","unstructured":"V. Srinivasan, IBM T.J. Watson Research Center, New York, personal communication."},{"key":"10.1016\/0304-3975(94)00191-K_BIB19","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0022-0000(91)90019-2","article-title":"An axiomatic approach to Voronoi diagrams in 3D","volume":"43","author":"Stifter","year":"1991","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(94)00191-K_BIB20","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1515\/crll.1908.134.198","article-title":"Nouvelles applications des param\u00e8tres continus \u00e0 la the\u00f3rie des formes quadratiques; deuxi\u00e8me m\u00e9moire: Recherches sur les parall\u00e9lo\u00e9dres primitifs","volume":"134","author":"Voronoi","year":"1908","journal-title":"J. Reine. Angew. Math."},{"key":"10.1016\/0304-3975(94)00191-K_BIB21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","article-title":"An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments","volume":"2","author":"Yap","year":"1987","journal-title":"Discrete Comput. Geo."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400191K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400191K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T19:22:36Z","timestamp":1580844156000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400191K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["030439759400191K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00191-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}