{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T18:10:01Z","timestamp":1673374201395},"reference-count":58,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":6316,"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":[[1996,4]]},"DOI":"10.1016\/0925-7721(95)00018-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:53:54Z","timestamp":1027608834000},"page":"45-68","source":"Crossref","is-referenced-by-count":7,"title":["Average case analysis of dynamic geometric optimization"],"prefix":"10.1016","volume":"6","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00018-6_BIB1_1","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF02574698","article-title":"Euclidean minimum spanning trees and bichromatic closest pairs","volume":"6","author":"Agarwal","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00018-6_BIB1_2","series-title":"6th Symp. Comp. Geom.","first-page":"203","article-title":"Euclidean minimum spanning trees and bichromatic closest pairs","author":"Agarwal","year":"1990"},{"key":"10.1016\/0925-7721(95)00018-6_BIB2","series-title":"Proc. 33rd IEEE Symp. Foundations of Computer Science","first-page":"80","article-title":"Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees","author":"Agarwal","year":"1992"},{"key":"10.1016\/0925-7721(95)00018-6_BIB3_1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0925-7721(92)90001-9","article-title":"Farthest neighbors, maximum spanning trees, and related problems in higher dimensions","volume":"4","author":"Agarwal","year":"1992","journal-title":"Comput. Geom.: Theory & Appl."},{"key":"10.1016\/0925-7721(95)00018-6_BIB3_2","series-title":"2nd Worksh. Algorithms and Data Structures","first-page":"105","article-title":"Farthest neighbors, maximum spanning trees, and related problems in higher dimensions","author":"Agarwal","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0925-7721(91)90001-U","article-title":"Off-line dynamic maintenance of the width of a planar point set","volume":"1","author":"Agarwal","year":"1991","journal-title":"Comput. Geom.: Theory & Appl."},{"key":"10.1016\/0925-7721(95)00018-6_BIB5","series-title":"Proc. 6th ACM-SIAM Symp. Discrete Algorithms","first-page":"312","article-title":"Average case analysis of dynamic graph algorithms","author":"Alberts","year":"1995"},{"key":"10.1016\/0925-7721(95)00018-6_BIB6_1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02574379","article-title":"Helly theorems and generalized linear programming","volume":"12","author":"Amenta","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00018-6_BIB6_2","series-title":"9th Symp. Comp. Geom.","first-page":"63","article-title":"Helly theorems and generalized linear programming","author":"Amenta","year":"1993"},{"key":"10.1016\/0925-7721(95)00018-6_BIB7","series-title":"Proc. 4th ACM Symp. Computational Geometry","first-page":"252","article-title":"Clustering algorithms based on minimum and maximum spanning trees","author":"Asano","year":"1988"},{"key":"10.1016\/0925-7721(95)00018-6_BIB8_1","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1006\/jagm.1994.1040","article-title":"Dynamic point location in general subdivisions","volume":"17","author":"Baumgarten","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(95)00018-6_BIB8_2","series-title":"3rd Symp. Discrete Algorithms","first-page":"250","article-title":"Dynamic point location in general subdivision","author":"Baumgarten","year":"1992"},{"key":"10.1016\/0925-7721(95)00018-6_BIB9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","article-title":"Decomposable searching problems I: Static-to-dynamic transformation","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(95)00018-6_BIB10","first-page":"223","article-title":"Voronoi diagrams from convex hulls","volume":"9","author":"Brown","year":"1979"},{"key":"10.1016\/0925-7721(95)00018-6_BIB11","series-title":"Average case and empirical study of sparsification","author":"Cattaneo","year":"1995"},{"key":"10.1016\/0925-7721(95)00018-6_BIB12_1","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1137\/0221057","article-title":"New results on dynamic planar point location","volume":"21","author":"Cheng","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00018-6_BIB12_2","series-title":"31st Symp. Found. Comp. Sci.","first-page":"96","article-title":"New results on dynamic planar point location","author":"Cheng","year":"1990"},{"key":"10.1016\/0925-7721(95)00018-6_BIB13_1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1142\/S0218195992000184","article-title":"Dynamization of the trapezoid method for planar point location","volume":"2","author":"Chiang","year":"1992","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"10.1016\/0925-7721(95)00018-6_BIB13_2","series-title":"7th Symp. Comp. Geom.","first-page":"61","article-title":"Dynamization of the trapezoid method for planar point location","author":"Chiang","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB14","series-title":"Proc. 4th ACM Symp. Computational Geometry","first-page":"12","article-title":"Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental","author":"Clarkson","year":"1988"},{"key":"10.1016\/0925-7721(95)00018-6_BIB15_1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0925-7721(92)90025-N","article-title":"Fully dynamic Delaunay triangulation in logarithmic expected time per operation","volume":"2","author":"Devillers","year":"1992","journal-title":"Comput. Geom.: Theory & Appl."},{"key":"10.1016\/0925-7721(95)00018-6_BIB15_2","series-title":"2nd Worksh. Algorithms and Data Structures","first-page":"42","article-title":"Fully dynamic Delaunay triangulation in logarithmic expected time per operation","author":"Devillers","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB16","series-title":"Proc. 8th ACM Symp. Computational Geometry","first-page":"43","article-title":"Incremental topological flipping works for regular triangulations","author":"Edelsbrunner","year":"1992"},{"key":"10.1016\/0925-7721(95)00018-6_BIB17_1","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1287\/ijoc.4.4.360","article-title":"Dynamic three-dimensional linear programming","volume":"4","author":"Eppstein","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0925-7721(95)00018-6_BIB17_2","series-title":"32nd Symp. Found. Comp. Sci.","first-page":"488","article-title":"Dynamic three-dimensional linear programming","author":"Eppstein","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB18_1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1006\/jagm.1994.1033","article-title":"Offline algorithms for dynamic minimum spanning tree problems","volume":"17","author":"Eppstein","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(95)00018-6_BIB18_2","series-title":"2nd Worksh. Algorithms and Data Structures","first-page":"392","article-title":"Offline algorithms for dynamic minimum spanning tree problems","author":"Eppstein","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02574030","article-title":"Dynamic euclidean minimum spanning trees and extrema of binary functions","volume":"13","author":"Eppstein","year":"1995","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00018-6_BIB20","series-title":"Proc. 33rd IEEE Symp. Foundations of Computer Science","first-page":"60","article-title":"Sparsification\u2014A technique for speeding up dynamic graph algorithms","author":"Eppstein","year":"1992"},{"key":"10.1016\/0925-7721(95)00018-6_BIB21","article-title":"Improved sparsification","author":"Eppstein","year":"1993"},{"key":"10.1016\/0925-7721(95)00018-6_BIB22_1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0196-6774(92)90004-V","article-title":"Maintenance of a minimum spanning forest in a dynamic plane graph","volume":"13","author":"Eppstein","year":"1992","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(95)00018-6_BIB22_2","series-title":"1st Symp. Discrete Algorithms","first-page":"1","article-title":"Maintenance of a minimum spanning forest in a dynamic plane graph","author":"Eppstein","year":"1990"},{"key":"10.1016\/0925-7721(95)00018-6_BIB23","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1137\/0214055","article-title":"Data structures for on-line updating of minimum spanning trees","volume":"14","author":"Frederickson","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00018-6_BIB24","series-title":"Proc. 23rd ACM Symp. Theory of Computing","first-page":"523","article-title":"Dynamic trees and dynamic point location","author":"Goodrich","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB25_1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01758770","article-title":"Randomized incremental construction of Delaunay and Voronoi diagrams","volume":"7","author":"Guibas","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(95)00018-6_BIB25_2","series-title":"17th Int. Coll. on Automata, Languages and Programming","first-page":"414","article-title":"Randomized incremental construction of Delaunay and Voronoi diagrams","author":"Guibas","year":"1990"},{"key":"10.1016\/0925-7721(95)00018-6_BIB26_1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1142\/S021819599300021X","article-title":"On maintaining the width and diameter of a planar point-set online","volume":"3","author":"Janardan","year":"1993","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"10.1016\/0925-7721(95)00018-6_BIB26_2","series-title":"2nd Int. Symp. Algorithms","first-page":"137","article-title":"On maintaining the width and diameter of a planar point-set online","author":"Janardan","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB27_1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02574686","article-title":"On the construction of abstract Voronoi diagrams","volume":"6","author":"Mehlhorn","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00018-6_BIB27_2","series-title":"Symp. Theor. Aspects of Comp. Sci.","first-page":"227","article-title":"On the construction of abstract Voronoi diagrams","author":"Mehlhorn","year":"1990"},{"key":"10.1016\/0925-7721(95)00018-6_BIB28_1","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF01840396","article-title":"Computing Euclidean maximum spanning trees","volume":"5","author":"Monma","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(95)00018-6_BIB28_2","series-title":"4th Symp. Comp. Geom.","first-page":"239","article-title":"Computing Euclidean maximum spanning trees","author":"Monma","year":"1988"},{"key":"10.1016\/0925-7721(95)00018-6_BIB29_1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0747-7171(08)80064-8","article-title":"A fast planar partition algorithm I","volume":"10","author":"Mulmuley","year":"1990","journal-title":"J. Sympbolic Computation"},{"key":"10.1016\/0925-7721(95)00018-6_BIB29_2","series-title":"29th Symp. Found. Comp. Sci.","first-page":"580","article-title":"A fast planar partition algorithm I","author":"Mulmuley","year":"1988"},{"key":"10.1016\/0925-7721(95)00018-6_BIB30","series-title":"Proc. 7th ACM Symp. Computational Geometry","first-page":"121","article-title":"Randomized multidimensional search trees: dynamic sampling","author":"Mulmuley","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB31","series-title":"Proc. 32nd IEEE Symp. Foundations of Computer Science","first-page":"180","article-title":"Randomized multidimensional search trees: Lazy balancing and dynamic shuffling","author":"Mulmuley","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB32","series-title":"Computational Geometry, An Introduction through Randomized Algorithms","author":"Mulmuley","year":"1993"},{"key":"10.1016\/0925-7721(95)00018-6_BIB33","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J. Comp. Syst. Sci."},{"key":"10.1016\/0925-7721(95)00018-6_BIB34","series-title":"Computational Geometry\u2014An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(95)00018-6_BIB35","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1137\/0218056","article-title":"Fully dynamic point location in a monotone subdivision","volume":"18","author":"Preparata","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00018-6_BIB36","first-page":"668","article-title":"Skip lists: A probabilistic alternative to balanced trees","volume":"33","author":"Pugh","year":"1990","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1016\/0925-7721(95)00018-6_BIB37","series-title":"Proc. 5th Canad. Conf. Computational Geometry","first-page":"258","article-title":"Maintaining the approximate width of a set of points in the plane","author":"Rote","year":"1993"},{"key":"10.1016\/0925-7721(95)00018-6_BIB38","series-title":"Proc. 32nd IEEE Symp. Foundations of Computer Science","first-page":"197","article-title":"Dynamic maintenance of geometric structures made easy","author":"Schwarzkopf","year":"1991"},{"key":"10.1016\/0925-7721(95)00018-6_BIB39_1","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF02574699","article-title":"Small-dimensional linear programming and convex hulls made easy","volume":"6","author":"Seidel","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00018-6_BIB39_2","series-title":"6th Symp. Comp. Geom.","first-page":"211","article-title":"Small-dimensional linear programming and convex hulls made easy","author":"Seidel","year":"1990"},{"key":"10.1016\/0925-7721(95)00018-6_BIB40","series-title":"Proc. 16th IEEE Symp. Foundations of Computer Science","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975"},{"key":"10.1016\/0925-7721(95)00018-6_BIB41","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","article-title":"A data structure for dynamic trees","volume":"24","author":"Sleator","year":"1983","journal-title":"J. Comp. Syst. Sci."},{"key":"10.1016\/0925-7721(95)00018-6_BIB42","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","article-title":"On constructing minimum spanning trees in k-dimensional space and related problems","volume":"11","author":"Yao","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000186?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000186?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T21:25:00Z","timestamp":1556400300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0925772195000186"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00018-6","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}