{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:43:07Z","timestamp":1787496187058,"version":"build-2736575974"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2002,2]]},"abstract":"<jats:p>We design a simple and elegant kinetic data structure for detecting collisions between polygonal (but not necessarily convex) objects in motion in the plane. Our structure is compact, maintaining an active set of certificates whose number is proportional to a minimum-size set of separating polygons for the objects. It is also responsive; on the failure of a certificate invariants can be restored in time logarithmic in the total number of object vertices. It is difficult to characterize the efficiency of our structure for lack of a canonical definition of external events. Nevertheless we give an easy upper bound on the worst case number of certificate failures.<\/jats:p>","DOI":"10.1142\/s0218195902000724","type":"journal-article","created":{"date-parts":[[2003,5,22]],"date-time":"2003-05-22T02:35:01Z","timestamp":1053570901000},"page":"3-27","source":"Crossref","is-referenced-by-count":36,"title":["KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS"],"prefix":"10.1142","volume":"12","author":[{"given":"DAVID","family":"KIRKPATRICK","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of British Columbia, 2366 Main Mall, Vancouver, B.C., V6T 1Z4, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"JACK","family":"SNOEYINK","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of North Carolina at Chapel Hill, CB 3175 Sitterson Hall, Chapel Hill, N.C.,  27516, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"BETTINA","family":"SPECKMANN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of British Columbia, 2366 Main Mall, Vancouver, B.C., V6T 1Z4, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01377183"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794263191"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195993000257"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1109\/2945.466717"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009323"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02716580"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90021-5"},{"key":"p_28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530889"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195902000724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:19:50Z","timestamp":1565176790000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195902000724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":8,"journal-issue":{"issue":"01n02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,2]]}},"alternative-id":["10.1142\/S0218195902000724"],"URL":"https:\/\/doi.org\/10.1142\/s0218195902000724","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}