{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:00Z","timestamp":1725494400348},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423065"},{"type":"electronic","value":"9783540477389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47738-1_21","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T17:52:49Z","timestamp":1194371569000},"page":"222-236","source":"Crossref","is-referenced-by-count":1,"title":["Separation Sensitive Kinetic Separation Structures for Convex Polygons"],"prefix":"10.1007","author":[{"given":"David","family":"Kirkpatrick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"P. K. Agarwal, J. Basch, M. de Berg, L. J. Guibas, and J. Hershberger. Lower bounds for kinetic planar subdivisions. In Proc. 15th ACM Sympos. Comp. Geom., pages 247\u2013254, 1999.","DOI":"10.1145\/304893.304961"},{"key":"21_CR2","unstructured":"P. K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang. Deformable free space tilings for kinetic collision detection. In Proc. 5th Workshop Algorithmic Found. Robotics, 2000."},{"key":"21_CR3","unstructured":"J. Basch, J. Erickson, L. J. Guibas, J. Hershberger, and L. Zhang. Kinetic collision detection for two simple polygons. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pages 102\u2013111, 1999."},{"key":"21_CR4","unstructured":"J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 747\u2013756, 1997."},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7531.24036","volume":"34","author":"B. Chazelle","year":"1987","unstructured":"B. Chazelle and D. P. Dobkin. Intersection of convex objects in two and three dimensions. J. ACM, 34(1):1\u201327, Jan. 1987.","journal-title":"J. ACM"},{"key":"21_CR6","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"D. Dobkin, J. Hershberger, D. Kirkpatrick, and S. Suri. Implicitly searching convolutions and computing depth of collision. In Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms, volume 450 of Lecture Notes Comput. Sci., pages 165\u2013180. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52921-7_66"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","volume":"27","author":"D. P. Dobkin","year":"1983","unstructured":"D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoret. Comput. Sci., 27(3):241\u2013253, Dec. 1983.","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0196-6774(85)90007-0","volume":"6","author":"D. P. Dobkin","year":"1985","unstructured":"D. P. Dobkin and D. G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. J. Algorithms, 6:381\u2013392, 1985.","journal-title":"J. Algorithms"},{"key":"21_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/BFb0032047","volume-title":"Automata, Languages and Programming, 17th International Colloquium","author":"D. P. Dobkin","year":"1990","unstructured":"D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra\u2013A unified approach. In M. S. Paterson, editor, Automata, Languages and Programming, 17th International Colloquium, volume 443 of Lecture Notes in Computer Science, pages 400\u2013413, Warwick University, England, 16\u201320 July 1990. Springer-Verlag."},{"key":"21_CR11","unstructured":"J. Erickson, L. Guibas, J. Stolfi, and L. Zhang. Separation-sensitive collision detection for convex objects. In Proc. 10th ACM-SIAM Sympos, Discrete Algorithms, pages 327\u2013336, 1999."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"L. Guibas, J. Snoeyink, and L. Zhang. Compact voronoi diagrams for moving convex polygons. In To appear Proc. 7th Scandinavian Workshop on Algorithm Theory, 2000.","DOI":"10.1007\/3-540-44985-X_30"},{"key":"21_CR13","unstructured":"L. J. Guibas. Kinetic data structures: A state of the art report. In Proc. 3rd Workshop Algorithmic Found. Robotics, pages 191\u2013209, 1998."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"D. Kirkpatrick, J. Snoeyink, and B. Speckmann. Kinetic collision detection for simple polygons. In Proc. 16th ACM Sympos. on Comp. Geom., pages 322\u2013330, 2000.","DOI":"10.1145\/336154.336219"},{"key":"21_CR15","unstructured":"D. Kirkpatrick and B. Speckmann. Separation sensitive kinetic collision detection for simple polygons. In preparation."},{"key":"21_CR16","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 Comp. Geom., 15:73\u2013105, 1996.","journal-title":"Discrete Comp. Geom."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"D. M. Mount. Intersection detection and separators for simple polygons. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 303\u2013311, 1992.","DOI":"10.1145\/142675.142737"},{"key":"21_CR18","unstructured":"S. Suri. Minimum link paths in polygons and related problems. PhD thesis, Dept. Comp. Sci., Johns Hopkins Univ., 1987."},{"key":"21_CR19","unstructured":"G. T. Toussaint. Shortest path solves translation separability of polygons. Technical Report SOCS-85.27, School Comput. Sci., McGill Univ., 1985."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47738-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T19:59:57Z","timestamp":1551038397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47738-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423065","9783540477389"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-47738-1_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}