{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T21:16:13Z","timestamp":1709068573335},"reference-count":22,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":6102,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/0925-7721(95)00028-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:56:11Z","timestamp":1027652171000},"page":"371-391","source":"Crossref","is-referenced-by-count":11,"title":["Fast algorithms for collision and proximity problems involving moving geometric objects"],"prefix":"10.1016","volume":"6","author":[{"given":"Prosenjit","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Janardan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00028-3_BIB1","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1006\/jagm.1994.1038","article-title":"Applications of parametric searching in geometric optimization","volume":"17","author":"Agarwal","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(95)00028-3_BIB2","series-title":"Proc. 22nd ACM Symp. Theory Comput.","first-page":"331","article-title":"Solving query-retrieval problems by compacting Voronoi diagrams","author":"Aggarwal","year":"1990"},{"key":"10.1016\/0925-7721(95)00028-3_BIB3","series-title":"Parallel Computational Geometry","author":"Akl","year":"1993"},{"key":"10.1016\/0925-7721(95)00028-3_BIB4","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/0898-1221(85)90105-1","article-title":"Some dynamic computational geometry problems","volume":"11","author":"Atallah","year":"1985","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0925-7721(95)00028-3_BIB5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02573973","article-title":"Diameter, width, closest line pair, and parametric searching","volume":"10","author":"Chazelle","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00028-3_BIB6","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","article-title":"The power of geometric duality","volume":"25","author":"Chazelle","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0925-7721(95)00028-3_BIB7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1142\/S0218195991000037","article-title":"Voronoi diagrams of moving points in the plane","volume":"1","author":"Fu","year":"1991","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0925-7721(95)00028-3_BIB8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/12.67328","article-title":"Minimum spanning trees of moving points in the plane","volume":"40","author":"Fu","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0925-7721(95)00028-3_BIB9","series-title":"Motion Planning in Dynamic Environments","author":"Fujimura","year":"1991"},{"key":"10.1016\/0925-7721(95)00028-3_BIB10","series-title":"Proc. 4th Canad. Conf. Comput. Geom.","first-page":"154","article-title":"Further dynamic computational geometry","author":"Golin","year":"1992"},{"key":"10.1016\/0925-7721(95)00028-3_BIB11","series-title":"Proc. 8th ACM Symp. Comput. Geom.","first-page":"110","article-title":"On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane","author":"Huttenlocher","year":"1992"},{"key":"10.1016\/0925-7721(95)00028-3_BIB12","article-title":"New results on data structures in computational geometry","author":"van Kreveld","year":"1992"},{"key":"10.1016\/0925-7721(95)00028-3_BIB13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02574697","article-title":"Cutting hyperplane arrangements","volume":"6","author":"Matou\u0161ek","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00028-3_BIB14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02293051","article-title":"Efficient partition trees","volume":"8","author":"Matou\u0161ek","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00028-3_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02573972","article-title":"Range searching with efficient hierarchical cuttings","volume":"10","author":"Matou\u0161ek","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00028-3_BIB16","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0925-7721(95)00028-3_BIB17","series-title":"Proc. 7th ACM Symp. Comput. Geom.","first-page":"239","article-title":"Transitions in geometric minimum spanning trees","author":"Monma","year":"1991"},{"key":"10.1016\/0925-7721(95)00028-3_BIB18","series-title":"Computational Geometry: An Introduction Through Randomized Algorithms","author":"Mulmuley","year":"1994"},{"key":"10.1016\/0925-7721(95)00028-3_BIB19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0734-189X(84)80040-7","article-title":"Dynamic sets of points","volume":"27","author":"Ottmann","year":"1984","journal-title":"Comput. Vision Graphics Image Processing"},{"key":"10.1016\/0925-7721(95)00028-3_BIB20","series-title":"Proc. 8th ACM Symp. Comput. Geom.","first-page":"130","article-title":"Incidence and nearest-neighbor problems for lines in 3-space","author":"Pellegrini","year":"1992"},{"key":"10.1016\/0925-7721(95)00028-3_BIB21","series-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1988"},{"key":"10.1016\/0925-7721(95)00028-3_BIB22","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","article-title":"Adding range restriction capability to dynamic data structures","volume":"32","author":"Willard","year":"1985","journal-title":"J. ACM"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:24:57Z","timestamp":1555212297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0925772195000283"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00028-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}