{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:19:21Z","timestamp":1773656361074,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Aided Geometric Design"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0167-8396(01)00050-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:16:12Z","timestamp":1027602972000},"page":"541-562","source":"Crossref","is-referenced-by-count":77,"title":["Voronoi diagram of a circle set from Voronoi diagram of a point set: I.\u00a0Topology"],"prefix":"10.1016","volume":"18","author":[{"given":"Deok-Soo","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donguk","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kokichi","family":"Sugihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8396(01)00050-4_BIB001","series-title":"Proc. 16th Annual Allerton Conference on Communications, Control and Computing","first-page":"833","article-title":"Generalized Voronoi diagram in the plane","author":"Drysdale","year":"1978"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB002","series-title":"Generalized Voronoi diagrams and geometric searching, Ph.D. Thesis","author":"Drysdale","year":"1979"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB003","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB004","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0167-8396(98)00039-9","article-title":"Swap conditions for dynamic Voronoi diagram for circles and line segments","volume":"16","author":"Gavrilova","year":"1999","journal-title":"Computer Aided Geometric Design"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB005","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1009934225596","article-title":"Exact computation of Delaunay and power triangulations","volume":"6","author":"Gavrilova","year":"2000","journal-title":"Reliable Computing"},{"issue":"6\/7","key":"10.1016\/S0167-8396(01)00050-4_BIB006","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/0010-4485(95)00043-7","article-title":"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves","volume":"28","author":"Hamann","year":"1996","journal-title":"Computer-Aided Design"},{"issue":"8","key":"10.1016\/S0167-8396(01)00050-4_BIB007","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/0010-4485(95)99797-C","article-title":"Representing the Voronoi diagram of a simple polygon using rational quadratic B\u00e9zier curves","volume":"27","author":"Kim","year":"1995","journal-title":"Computer-Aided Design"},{"issue":"14","key":"10.1016\/S0167-8396(01)00050-4_BIB008","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1016\/S0010-4485(98)00063-3","article-title":"Polygon offsetting using a Voronoi diagram and two stacks","volume":"30","author":"Kim","year":"1998","journal-title":"Computer-Aided Design"},{"issue":"6","key":"10.1016\/S0167-8396(01)00050-4_BIB009","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0167-8396(01)00051-6","article-title":"Voronoi diagram of a circle set from Voronoi diagram of a point set: II","volume":"18","author":"Kim","year":"2000","journal-title":"Geometry. Computer Aided Geometric Design"},{"issue":"1","key":"10.1016\/S0167-8396(01)00050-4_BIB010","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0210006","article-title":"Generalization of Voronoi diagrams in the plane","volume":"10","author":"Lee","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-8396(01)00050-4_BIB011","series-title":"An Introduction to Solid Modeling","author":"M\u00e4ntyl\u00e4","year":"1988"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB012","series-title":"Spatial Tessellations Concepts and Applications of Voronoi Diagram","author":"Okabe","year":"1992"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB013","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"issue":"2","key":"10.1016\/S0167-8396(01)00050-4_BIB014","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0214034","article-title":"Intersection and closest-pair problems for a set of planar discs","volume":"14","author":"Sharir","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/S0167-8396(01)00050-4_BIB015","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1006\/cgip.1993.1039","article-title":"Approximation of generalized Voronoi diagrams by ordinary Voronoi diagrams","volume":"55","author":"Sugihara","year":"1993","journal-title":"Graphical Models and Image Processing"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB016","series-title":"Proc. IEEE International Conference on Shape Modeling and Applications, Aizu-Wakamatsu, Japan","first-page":"160","article-title":"Experimental study on acceleration of an exact-arithmetic geometric algorithm","author":"Sugihara","year":"1997"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB017","unstructured":"Sugihara, K., 2000. http:\/\/www.simplex.t.u-tokyo.ac.jp\/~sugihara\/"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB018","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1109\/5.163412","article-title":"Construction of the Voronoi diagram for one million generators in single-precision arithmetic","volume":"80","author":"Sugihara","year":"1992","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0167-8396(01)00050-4_BIB019","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","article-title":"An O(nlogn) algorithm for the Voronoi diagram of a set of simple curve segments","volume":"2","author":"Yap","year":"1987","journal-title":"Discrete Comput. Geom."}],"container-title":["Computer Aided Geometric Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167839601000504?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167839601000504?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:28:30Z","timestamp":1556148510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167839601000504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0167839601000504"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8396(01)00050-4","relation":{},"ISSN":["0167-8396"],"issn-type":[{"value":"0167-8396","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}