{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T20:46:52Z","timestamp":1761511612564,"version":"build-2065373602"},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4886,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1016\/s0304-3975(99)00202-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:05Z","timestamp":1027633865000},"page":"325-337","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["Three-dimensional convex hull as a fruitful source of diagrams"],"prefix":"10.1016","volume":"235","author":[{"given":"Kokichi","family":"Sugihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00202-9_BIB1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/0216006","article-title":"Power diagram \u2014 properties, algorithms and applications","volume":"16","author":"Aurenhammer","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00202-9_BIB2","doi-asserted-by":"crossref","unstructured":"M. Benouamer, D. Michelucci, B. Peroche, Error-free boundary evaluation using lazy rational arithmetic \u2014 a detailed implementation, Proc. 2nd Symp. on Solid Modeling and Applications, Montreal, 1993, pp. 115\u2013126.","DOI":"10.1145\/164360.164403"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(79)90074-7","article-title":"Voronoi diagrams from convex hulls","volume":"9","author":"Brown","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00202-9_BIB4","doi-asserted-by":"crossref","unstructured":"D. Dobkin, D. Silver, Recipes for geometric and numerical analysis \u2014 Part I, An empirical study. Proc. 4th ACM Annual Symp. on Computational Geometry, Urbana-Chanpaign, 1988, pp. 93\u2013105.","DOI":"10.1145\/73393.73404"},{"year":"1987","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","key":"10.1016\/S0304-3975(99)00202-9_BIB5"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB6","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, E.P. M\u00fccke, Simulation of simplicity \u2014 a technique to cope with degenerate cases in geometric algorithms, Proc. 4th ACM Symp. on Computational Geometry, Urbana-Champaign, 1988, pp. 118\u2013133.","DOI":"10.1145\/73393.73406"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","article-title":"Voronoi diagrams and arrangements","volume":"1","author":"Edelsbrunner","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0304-3975(99)00202-9_BIB8","doi-asserted-by":"crossref","unstructured":"S. Fortune, C. von Wyk, Efficient exact arithmetic for computational geometry, Proc. 9th ACM Annual Symp. on Computational Geometry, San Diego, 1993, pp. 163\u2013172.","DOI":"10.1145\/160985.161015"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB9","doi-asserted-by":"crossref","unstructured":"L. Guibas, D. Salesin, J. Stolfi, Epsilon geometry \u2014 building robust algorithms from imprecise calculations, Proc. 5th ACM Annual Symp. on Computational Geometry, Saarbr\u00fccken, 1989, pp. 208\u2013217.","DOI":"10.1145\/73833.73857"},{"issue":"3","key":"10.1016\/S0304-3975(99)00202-9_BIB10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/2.16223","article-title":"The problem of accuracy and robustness in geometric computation","volume":"22","author":"Hoffmann","year":"1989","journal-title":"Computer"},{"year":"1989","series-title":"Geometric and Solid Modeling \u2014 An Introduction","author":"Hoffmann","key":"10.1016\/S0304-3975(99)00202-9_BIB11"},{"issue":"1","key":"10.1016\/S0304-3975(99)00202-9_BIB12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0214006","article-title":"Voronoi diagram in the Laguerre geometry and its applications","volume":"14","author":"Imai","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00202-9_BIB13","first-page":"1991","volume":"ACM Trans. Graphics","author":"Karasick","journal-title":"Efficient Delaunay triangulation using rational arithmetic"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB14","doi-asserted-by":"crossref","unstructured":"D.E. Knuth, Axioms and Hulls, Lecture Notes in Computer Science, no. 606, Springer, Berlin, 1992.","DOI":"10.1007\/3-540-55611-7"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0004-3702(88)90061-6","article-title":"Verifiable implementation of geometric algorithms using finite precision arithmetic","volume":"37","author":"Milenkovic","year":"1988","journal-title":"Artif. Intell."},{"year":"1992","series-title":"Spatial Tessellations \u2014 Concepts and Applications of Voronoi Diagrams","author":"Okabe","key":"10.1016\/S0304-3975(99)00202-9_BIB16"},{"year":"1985","series-title":"Computational Geometry \u2014 An Introduction","author":"Preparata","key":"10.1016\/S0304-3975(99)00202-9_BIB17"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB18","doi-asserted-by":"crossref","unstructured":"M. Segal, C.H. Sequin, Consistent calculations for solid modeling, Proc. ACM Symp. on Computational Geometry, Baltimore, 1985, pp. 29\u201338.","DOI":"10.1145\/323233.323238"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB19","first-page":"468","article-title":"A simple method for avoiding numerical errors and degeneracy in Voronoi diagram construction","volume":"E75-A","author":"Sugihara","year":"1992","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"6","key":"10.1016\/S0304-3975(99)00202-9_BIB20","first-page":"522","article-title":"Approximation of generalized Voronoi diagrams by ordinary Voronoi diagrams","volume":"55","author":"Sugihara","year":"1993","journal-title":"CVGIP: Graphical Models Image Process."},{"key":"10.1016\/S0304-3975(99)00202-9_BIB21","doi-asserted-by":"crossref","unstructured":"K. Sugihara, A robust and consistent algorithm for intersecting convex polyhedra, EUROGRAPHICS\u201994, Oslo, 1994, pp. C-45\u2013C-54.","DOI":"10.1111\/1467-8659.1330045"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB22","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0022-0000(05)80056-X","article-title":"Robust gift wrapping for the three-dimensional convex hull","volume":"49","author":"Sugihara","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00202-9_BIB23","unstructured":"K. Sugihara, Laguerre Voronoi diagram on the sphere, preprint."},{"key":"10.1016\/S0304-3975(99)00202-9_BIB24","first-page":"380","article-title":"A solid modelling system free from topological inconsistency","volume":"12","author":"Sugihara","year":"1989","journal-title":"J. Inform. Process."},{"key":"10.1016\/S0304-3975(99)00202-9_BIB25","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1109\/5.163412","article-title":"Construction of the Voronoi diagram for \u201cone million\u201d generators in single-precision arithmetic","volume":"80","author":"Sugihara","year":"1992","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB26","doi-asserted-by":"crossref","unstructured":"C.-K. Yap, A geometric consistency theorem for a symbolic perturbation theorem, Proc. 4th ACM Annual Symp. on Computational Geometry, Urbana-Champaign, 1988, pp. 134\u2013142.","DOI":"10.1145\/73393.73407"},{"key":"10.1016\/S0304-3975(99)00202-9_BIB27","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0747-7171(08)80069-7","article-title":"Symbolic treatment of geometric degeneracies","volume":"10","author":"Yap","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(99)00202-9_BIB28","unstructured":"C.-K. Yap, Toward exact geometric computation, Proc. 5th Canadian Conf. on Computational Geometry, Waterloo, 1993, pp. 405\u2013419."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:56Z","timestamp":1759625516000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0304397599002029"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00202-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Three-dimensional convex hull as a fruitful source of diagrams","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(99)00202-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}