{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T06:04:39Z","timestamp":1672985079201},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0022-0000(93)90041-t","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"437-458","source":"Crossref","is-referenced-by-count":4,"title":["Output sensitive and dynamic constructions of higher order voronoi diagrams and levels in arrangements"],"prefix":"10.1016","volume":"47","author":[{"given":"Ketan","family":"Mulmuley","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90041-T_BIB1","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/BF02187749","article-title":"A linear time algorithm for computing the Voronoi diagram of a convex polygon","volume":"4","author":"Agarwal","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0022-0000(93)90041-T_BIB2","series-title":"Proceedings of the 2nd ACM Symp. on Comp. Geom","first-page":"260","article-title":"A heirachial representation of objects: The Delaunay tree","author":"Boissonnat","year":"1986"},{"key":"10.1016\/0022-0000(93)90041-T_BIB3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.7146\/math.scand.a-11045","article-title":"Shellable decompositions of cells and spheres","volume":"29","author":"Bruggesser","year":"1971","journal-title":"Math. Scand."},{"key":"10.1016\/0022-0000(93)90041-T_BIB4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02187879","article-title":"New applications of random sampling in computational geometry","volume":"2","author":"Clarkson","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0022-0000(93)90041-T_BIB5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry, II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0022-0000(93)90041-T_BIB6","series-title":"Proceedings, 29th IEEE Symp. on Foundations of Comput. Sci.","first-page":"452","article-title":"A Las Vegas algorithm for linear programming when the dimension is small","author":"Clarkson","year":"1988"},{"key":"10.1016\/0022-0000(93)90041-T_BIB7","series-title":"Proceedings of the 29th IEEE Symp. on Foundations of Comput. Sci.","first-page":"568","article-title":"Combinatorial complexity bounds for arrangements of curves and surfaces","author":"Clarkson","year":"1988"},{"key":"10.1016\/0022-0000(93)90041-T_BIB8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01840438","article-title":"Edge skeletons in arrangements with applications","volume":"1","author":"Edelsbrunner","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(93)90041-T_BIB9","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\/0022-0000(93)90041-T_BIB10","series-title":"Probabilistic Methods in Combinatorics","author":"Erdvs","year":"1974"},{"key":"10.1016\/0022-0000(93)90041-T_BIB11","first-page":"414","article-title":"Randomized incremental construction of Delaunay and Voronoi diagrams","volume":"Vol. 443","author":"Guibas","year":"1990"},{"key":"10.1016\/0022-0000(93)90041-T_BIB12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","article-title":"\u03b5-nets and simplex range querries","volume":"2","author":"Haussler","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0022-0000(93)90041-T_BIB13","volume":"Vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/0022-0000(93)90041-T_BIB14","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1982.1676031","article-title":"On k-nearest neighbour Voronoi diagrams in the plane","volume":"C-31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(93)90041-T_BIB15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 4","key":"10.1016\/0022-0000(93)90041-T_BIB16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02574692","article-title":"On levels in arrangements and Voronoi diagrams","volume":"6","author":"Mulmuley","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0022-0000(93)90041-T_BIB17","series-title":"Proceedings, Annual ACM Symposium on Computational Geometry","first-page":"121","article-title":"Randomized multidimensional search trees: Dynamic sampling","author":"Mulmuley","year":"1991"},{"key":"10.1016\/0022-0000(93)90041-T_BIB18","series-title":"Proceedings, ACM Sympos. on Theory of Computing 1986","first-page":"404","article-title":"Constructing higher dimension convex hulls at logarithmic cost per face","author":"Seidel","year":"1986"},{"key":"10.1016\/0022-0000(93)90041-T_BIB19","series-title":"A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Traingulating Polygons","author":"Seidel","year":"1990"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390041T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390041T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:58:16Z","timestamp":1550325496000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390041T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["002200009390041T"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90041-t","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}