{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:45:41Z","timestamp":1767033941278},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0925-7721(02)00123-2","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:26:08Z","timestamp":1051737968000},"page":"197-231","source":"Crossref","is-referenced-by-count":20,"title":["On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes"],"prefix":"10.1016","volume":"25","author":[{"given":"Mordecai J.","family":"Golin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyeon-Suk","family":"Na","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(02)00123-2_BIB001","doi-asserted-by":"crossref","unstructured":"D. Attali, J.-D. Boissonnat, Complexity of the Delaunay triangulation of points on a smooth surface, Preprint, January 2001","DOI":"10.1145\/566282.566304"},{"key":"10.1016\/S0925-7721(02)00123-2_BIB002","doi-asserted-by":"crossref","unstructured":"D. Attali, J.-D. Boissonnat, A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces, Submitted to Solid Modeling 2002. Also available at http:\/\/www.inria.fr\/sophia\/prisme\/personnel\/boissonnat\/","DOI":"10.1145\/566282.566304"},{"key":"10.1016\/S0925-7721(02)00123-2_BIB003","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/0216006","article-title":"Power diagrams: properties, algorithms and applications","volume":"16","author":"Aurenhammer","year":"1987","journal-title":"SIAM J. Computing"},{"issue":"4","key":"10.1016\/S0925-7721(02)00123-2_BIB004","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","article-title":"Optimal expected-time algorithms for closest point problems","volume":"6","author":"Bentley","year":"1980","journal-title":"ACM Trans. on Mathematical Software"},{"issue":"4","key":"10.1016\/S0925-7721(02)00123-2_BIB005","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02574694","article-title":"Higher-dimensional Voronoi diagrams in linear expected time","volume":"6","author":"Dwyer","year":"1991","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"10.1016\/S0925-7721(02)00123-2_BIB006","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0898-1221(93)90068-7","article-title":"The expected number of k-faces of a Voronoi diagram","volume":"26","author":"Dwyer","year":"1993","journal-title":"Computers Math. Applications"},{"key":"10.1016\/S0925-7721(02)00123-2_BIB007","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0925-7721(02)00123-2_BIB008","doi-asserted-by":"crossref","unstructured":"J. Erickson, Nice point sets can have nasty Delaunay triangulations, in: Proceedings of the 17th Annual ACM Symposium on Computational Geometry, 3\u20135 June 2001, pp. 96\u2013105","DOI":"10.1145\/378583.378636"},{"key":"10.1016\/S0925-7721(02)00123-2_BIB009","series-title":"Probability and Random Processes","author":"Grimmett","year":"1992"},{"key":"10.1016\/S0925-7721(02)00123-2_BIB010","unstructured":"M. Golin, H.-S. Na, On the proofs of two lemmas describing the intersections of spheres with the boundary of a convex polytope, Hong Kong UST Theoretical Computer Science Center, Technical Report HKUST-TCSC-2001-09, July 2001. Available from http:\/\/www.cs.ust.hk\/tcsc\/RR"},{"key":"10.1016\/S0925-7721(02)00123-2_BIB011","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001232?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001232?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T19:18:39Z","timestamp":1584472719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772102001232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0925772102001232"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(02)00123-2","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}