{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:02:01Z","timestamp":1725494521676},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676904"},{"type":"electronic","value":"9783540449850"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44985-x_30","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:17:33Z","timestamp":1194985053000},"page":"339-352","source":"Crossref","is-referenced-by-count":4,"title":["Compact Voronoi Diagrams for Moving Convex Polygons"],"prefix":"10.1007","author":[{"given":"Leonidas J.","family":"Guibas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"30_CR1","unstructured":"BEG+99._J. Basch, J. Erickson, L. J. Guibas, J. Hershberger, and L. Zhang. Kinetic collision detection for two simple polygons. In Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, pages 102\u2013111, 1999."},{"key":"30_CR2","unstructured":"J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 747\u2013756, 1997."},{"key":"30_CR3","unstructured":"Jeff Erickson, L. J. Guibas, Jorge Stofi, and L. Zhang. Separation-sensitive kinetic collision detection for convex objects. In Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, 1999."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"L. J. Guibas, J. S. B. Mitchell, and T. Roos. Voronoi diagrams of moving points in the plane. In G. Schmidt and R. Berghammer, editors, Proc. 17th Internat. Workshop Graph-Theoret. Concepts Comput. Sci., volume 570 of Lecture Notes Comput. Sci., pages 113\u2013125. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55121-2_11"},{"key":"30_CR5","unstructured":"L. Guibas and L. Zhang. Euclidean proximity and power diagram. In Proc. 10th Canadian Conference on Computatoinal Geometry, 1998."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"D. P. Huttenlocher, K. Kedem, and J. M. Kleinberg. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 110\u2013119, 1992.","DOI":"10.1145\/142675.142700"},{"key":"30_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning.","author":"J.-C. Latombe","year":"1991","unstructured":"J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1109\/ROBOT.1991.131723","volume":"2","author":"M. C. Lin","year":"1991","unstructured":"M. C. Lin and J. F. Canny. Efficient algorithms for incremental distance computation. In Proc. IEEE Internat. Conf. Robot. Autom., volume 2, pages 1008\u20131014, 1991.","journal-title":"Proc. IEEE Internat. Conf. Robot. Autom."},{"key":"30_CR9","unstructured":"B. Mirtich. V-Clip: fast and robust polyhedral collision detection. Technical Report TR-97-05, Mitsubishi Electrical Research Laboratory, 1997."},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02716580","volume":"15","author":"M. McAllister","year":"1996","unstructured":"M. McAllister, D. Kirkpatrick, and J. Snoeyink. A compact piecewise-linear Voronoi diagram for convex sites in the plane. Discrete Comput. Geom., 15:73\u2013105, 1996.","journal-title":"Discrete Comput. Geom."},{"key":"30_CR11","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, October 1990."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44985-X_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T07:02:08Z","timestamp":1551078128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44985-X_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676904","9783540449850"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44985-x_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}