{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:30:11Z","timestamp":1754152211754,"version":"3.41.2"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1983,9]]},"DOI":"10.1109\/tit.1983.1056738","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"724-731","source":"Crossref","is-referenced-by-count":36,"title":["Dynamic Voronoi diagrams"],"prefix":"10.1109","volume":"29","author":[{"given":"I.","family":"Gowda","sequence":"first","affiliation":[]},{"given":"D.","family":"Kirkpatrick","sequence":"additional","affiliation":[]},{"given":"D.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"A.","family":"Naamad","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","first-page":"1324","article-title":"Pattern recognition and geometrical complexity","author":"toussaint","year":"1980","journal-title":"Proc Int Conf Pattern Recog"},{"year":"1973","author":"knuth","journal-title":"The Art of Computer Programming Vol 3 Sorting and Searching","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/322217.322219"},{"year":"1980","author":"lee","journal-title":"Farthest neighbor Voronoi diagrams and applications","key":"ref12"},{"year":"1980","author":"lee","journal-title":"A dynamic data structure for Voronoi diagrams and its applications","key":"ref13"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/S0020-0190(80)90073-3"},{"year":"1980","author":"van leeuwen","journal-title":"Dynamic systems of static data structures","key":"ref15"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1137\/0209046"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1111\/j.1538-4632.1980.tb00031.x"},{"key":"ref18","first-page":"17","author":"maurer","year":"1980","journal-title":"Discrete Structures and Algorithms"},{"year":"1981","author":"naamad","journal-title":"Generalization of heaps and its applications","key":"ref19"},{"year":"1980","author":"supowit","journal-title":"The relative Neighborhood graph with an application to minimum spanning trees","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1137\/0205051"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/SFCS.1975.8"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/355921.355927"},{"year":"1980","author":"gowda","journal-title":"Dynamic problems in computational geometry","key":"ref6"},{"year":"1979","author":"toussaint","journal-title":"The relative neighborhood graph of a finite planar set","key":"ref29"},{"year":"1979","author":"edelsbrunner","journal-title":"Optimizing the dynamization of decomposable searching problems","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/SFCS.1979.15"},{"key":"ref7","first-page":"1","article-title":"Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures","author":"gowda","year":"1980","journal-title":"Proc Ann Allerton Conf Communication Contr Computing"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/0020-0190(79)90117-0"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1137\/0212002"},{"year":"1974","author":"aho","journal-title":"The Design and Analysis of Computer Algorithms","key":"ref1"},{"year":"1982","author":"naamad","journal-title":"A note on dynamization of order decomposable set problems","key":"ref20"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1016\/0196-6774(81)90025-0"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1137\/0202005"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/0020-0190(81)90093-4"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/BF02241781"},{"year":"1975","author":"shamos","journal-title":"Problems in computational geometry","key":"ref26"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/SFCS.1979.47"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22734\/01056738.pdf?arnumber=1056738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:36Z","timestamp":1753121256000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056738\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056738","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}