{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:59:58Z","timestamp":1649091598844},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T00:00:00Z","timestamp":1240876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s00454-009-9170-6","type":"journal-article","created":{"date-parts":[[2009,4,27]],"date-time":"2009-04-27T15:26:26Z","timestamp":1240845986000},"page":"399-420","source":"Crossref","is-referenced-by-count":3,"title":["Markov Incremental Constructions"],"prefix":"10.1007","volume":"42","author":[{"given":"Bernard","family":"Chazelle","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,4,28]]},"reference":[{"issue":"2","key":"9170_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01194923","volume":"92","author":"D. Aldous","year":"1992","unstructured":"Aldous, D., Steele, J.M.: Asymptotics for Euclidean minimal spanning trees on random points. Probab. Theory Relat. Fields 92(2), 247\u2013258 (1992)","journal-title":"Probab. Theory Relat. Fields"},{"key":"9170_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/777792.777824","volume-title":"SCG \u201903: Proceedings of the Nineteenth Annual Symposium on Computational Geometry","author":"N. Amenta","year":"2003","unstructured":"Amenta, N., Choi, S., Rote, G.: Incremental constructions con BRIO. In: SCG \u201903: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, pp. 211\u2013219. ACM, New York (2003)"},{"issue":"1","key":"9170_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/S0895480194264988","volume":"9","author":"G. Barnes","year":"1996","unstructured":"Barnes, G., Feige, U.: Short random walks on graphs. SIAM J. Discrete Math. 9(1), 19\u201328 (1996)","journal-title":"SIAM J. Discrete Math."},{"key":"9170_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2000)"},{"issue":"1","key":"9170_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02293035","volume":"8","author":"J.D. Boissonnat","year":"1992","unstructured":"Boissonnat, J.D., Devillers, O., Schott, R., Teillaud, M., Yvinec, M.: Applications of random sampling to on-line algorithms in computational geometry. Discrete Comput. Geom. 8(1), 51\u201371 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"9170_CR6","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/10515.10543","volume-title":"SCG \u201986: Proceedings of the Second Annual Symposium on Computational Geometry","author":"J.D. Boissonnat","year":"1986","unstructured":"Boissonnat, J.D., Teillaud, M.: The hierarchical representation of objects: the Delaunay tree. In: SCG \u201986: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 260\u2013268. ACM, New York (1986)"},{"issue":"2","key":"9170_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(93)90024-N","volume":"112","author":"J.D. Boissonnat","year":"1993","unstructured":"Boissonnat, J.D., Teillaud, M.: On the randomized construction of the Delaunay tree. Theor. Comput. Sci. 112(2), 339\u2013354 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"9170_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172998","volume-title":"Algorithmic Geometry","author":"J.D. Boissonnat","year":"1998","unstructured":"Boissonnat, J.D., Yvinec, M.: Algorithmic Geometry. Cambridge University Press, New York (1998)"},{"issue":"1","key":"9170_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01048273","volume":"2","author":"A.Z. Broder","year":"1989","unstructured":"Broder, A.Z., Karlin, A.R.: Bounds on the cover time. J. Theor. Probab. 2(1), 101\u2013120 (1989)","journal-title":"J. Theor. Probab."},{"issue":"4","key":"9170_CR10","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1214\/aoap\/1177005280","volume":"3","author":"P. Chassaing","year":"1993","unstructured":"Chassaing, P.: Optimality of move-to-front for self-organizing data structures with locality of references. Ann. Appl. Probab. 3(4), 1219\u20131240 (1993)","journal-title":"Ann. Appl. Probab."},{"key":"9170_CR11","first-page":"895","volume-title":"Handbook of discrete and computational geometry","author":"O. Cheong","year":"2004","unstructured":"Cheong, O., Mulmuley, K., Ramos, E.A.: Randomization and derandomization. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of discrete and computational geometry, 2nd edn., pp. 895\u2013926. CRC Press, Boca Raton (2004)","edition":"2"},{"key":"9170_CR12","unstructured":"Chew, L.P.: Building Voronoi diagrams for convex polygons in linear expected time. Tech. Rep. PCS-TR90-147, Dartmouth College, Hanover, NH, USA (1990)"},{"key":"9170_CR13","series-title":"CBMS Regional Conference Series in Mathematics","volume-title":"Spectral Graph Theory","author":"F.R.K. Chung","year":"1997","unstructured":"Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, vol.\u00a092. American Mathematical Society, Providence (1997)"},{"issue":"4","key":"9170_CR14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0925-7721(93)90009-U","volume":"3","author":"K.L. Clarkson","year":"1993","unstructured":"Clarkson, K.L., Mehlhorn, K., Seidel, R.: Four results on randomized incremental constructions. Comput. Geom. 3(4), 185\u2013212 (1993)","journal-title":"Comput. Geom."},{"issue":"5","key":"9170_CR15","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4(5), 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9170_CR16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1142\/S0129054102001035","volume":"13","author":"O. Devillers","year":"2002","unstructured":"Devillers, O.: The Delaunay hierarchy. Int. J. Found. Comput. Sci. 13, 163\u2013180 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"9170_CR17","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1142\/S021819590100064X","volume":"11","author":"O. Devillers","year":"2001","unstructured":"Devillers, O., Guigue, P.: The shuffling buffer. Int. J. Comput. Geom. Appl. 11(5), 555\u2013572 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"9170_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0925-7721(92)90025-N","volume":"2","author":"O. Devillers","year":"1992","unstructured":"Devillers, O., Meiser, S., Teillaud, M.: Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Comput. Geom. 2(2), 55\u201380 (1992)","journal-title":"Comput. Geom."},{"key":"9170_CR19","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-57568-5_231","volume-title":"Algorithms and computation","author":"K. Dobrindt","year":"1993","unstructured":"Dobrindt, K., Yvinec, M.: Remembering conflicts in history yields dynamic algorithms. In: Algorithms and computation, Hong Kong, 1993. Lecture Notes in Comput. Sci., vol. 762, pp. 21\u201330. Springer, Berlin (1993)"},{"issue":"3","key":"9170_CR20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00009293","volume":"17","author":"D. Eppstein","year":"1997","unstructured":"Eppstein, D., Paterson, M.S., Yao, F.F.: On nearest-neighbor graphs. Discrete Comput. Geom. 17(3), 263\u2013282 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"9170_CR21","first-page":"1","volume-title":"Selected Papers from the International Workshop on Sensor Based Intelligent Robots","author":"D. Fox","year":"1999","unstructured":"Fox, D., Burgard, W., Thrun, S.: Markov localization for reliable robot navigation and people detection. In: Selected Papers from the International Workshop on Sensor Based Intelligent Robots, pp.\u00a01\u201320. Springer, London (1999)"},{"issue":"4","key":"9170_CR22","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"L.J. Guibas","year":"1992","unstructured":"Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7(4), 381\u2013413 (1992)","journal-title":"Algorithmica"},{"key":"9170_CR23","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1990","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1990)"},{"issue":"5","key":"9170_CR24","first-page":"283","volume":"29","author":"G. Hotz","year":"1993","unstructured":"Hotz, G.: Search trees and search graphs for Markov sources. Elektron. Informationsverarbeitung Kybern. 29(5), 283\u2013292 (1993)","journal-title":"Elektron. Informationsverarbeitung Kybern."},{"key":"9170_CR25","doi-asserted-by":"crossref","DOI":"10.1201\/b10685","volume-title":"Realistic Image Synthesis Using Photon Mapping","author":"H.W. Jensen","year":"2001","unstructured":"Jensen, H.W.: Realistic Image Synthesis Using Photon Mapping. Peters, Natick (2001)"},{"issue":"2","key":"9170_CR26","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BF01759046","volume":"6","author":"S. Kapoor","year":"1991","unstructured":"Kapoor, S., Reingold, E.M.: Stochastic rearrangement rules for self-organizing data structures. Algorithmica 6(2), 278\u2013291 (1991)","journal-title":"Algorithmica"},{"issue":"3","key":"9170_CR27","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1137\/S0097539794268042","volume":"30","author":"A.R. Karlin","year":"2000","unstructured":"Karlin, A.R., Phillips, S.J., Raghavan, P.: Markov paging. SIAM J. Comput. 30(3), 906\u2013922 (2000)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"9170_CR28","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(81)90016-8","volume":"12","author":"L.K. Konneker","year":"1981","unstructured":"Konneker, L.K., Varol, Y.L.: A note on heuristics for dynamic organization of data structures. Inf. Process. Lett. 12(5), 213\u2013216 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9170_CR29","doi-asserted-by":"crossref","first-page":"343","DOI":"10.2307\/3213645","volume":"21","author":"K. Lam","year":"1984","unstructured":"Lam, K., Leung, M.Y., Siu, M.K.: Self-organizing files with dependent accesses. J. Appl. Probab. 21(2), 343\u2013359 (1984)","journal-title":"J. Appl. Probab."},{"key":"9170_CR30","first-page":"493","volume-title":"ICIG \u201904: Proceedings of the Third International Conference on Image and Graphics","author":"P. Lu","year":"2004","unstructured":"Lu, P., Zeng, X., Huang, X., Wang, Y.: Navigation in 3D game by Markov model based head pose estimating. In: ICIG \u201904: Proceedings of the Third International Conference on Image and Graphics, pp. 493\u2013496. IEEE Computer Society, Washington (2004)"},{"issue":"4\u20135","key":"9170_CR31","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J. Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4\u20135), 498\u2013516 (1996)","journal-title":"Algorithmica"},{"key":"9170_CR32","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(93)90011-T","volume":"3","author":"K. Mehlhorn","year":"1993","unstructured":"Mehlhorn, K., Sharir, M., Welzl, E.: Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection. Comput. Geom. 3, 235\u2013246 (1993)","journal-title":"Comput. Geom."},{"key":"9170_CR33","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"3\u20134","key":"9170_CR34","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0747-7171(08)80064-8","volume":"10","author":"K. Mulmuley","year":"1990","unstructured":"Mulmuley, K.: A fast planar partition algorithm, I. J. Symb. Comput. 10(3\u20134), 253\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"9170_CR35","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/102782.102785","volume":"38","author":"K. Mulmuley","year":"1991","unstructured":"Mulmuley, K.: A fast planar partition algorithm, II. J. ACM 38(1), 74\u2013103 (1991)","journal-title":"J. ACM"},{"key":"9170_CR36","volume-title":"Computational Geometry: An Introduction through Randomized Algorithms","author":"K. Mulmuley","year":"1994","unstructured":"Mulmuley, K.: Computational Geometry: An Introduction through Randomized Algorithms. Prentice-Hall, Englewood Cliffs (1994)"},{"issue":"4\u20135","key":"9170_CR37","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/BF01940875","volume":"16","author":"K. Mulmuley","year":"1996","unstructured":"Mulmuley, K.: Randomized geometric algorithms and pseudorandom generators. Algorithmica 16(4\u20135), 450\u2013463 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"9170_CR38","doi-asserted-by":"crossref","first-page":"790","DOI":"10.2307\/3215104","volume":"34","author":"R.M. Phatarfod","year":"1997","unstructured":"Phatarfod, R.M., Pryde, A.J., Dyte, D.: On the move-to-front scheme with Markov dependent requests. J. Appl. Probab. 34(3), 790\u2013794 (1997)","journal-title":"J. Appl. Probab."},{"key":"9170_CR39","doi-asserted-by":"crossref","unstructured":"Schulz, F., Sch\u00f6mer, E.: Self-organizing data structures with dependent accesses. In: ICALP, pp. 526\u2013537 (1996)","DOI":"10.1007\/3-540-61440-0_156"},{"key":"9170_CR40","first-page":"197","volume-title":"Proceedings of the 32nd annual symposium on Foundations of Computer Science","author":"O. Schwarzkopf","year":"1991","unstructured":"Schwarzkopf, O.: Dynamic maintenance of geometric structures made easy. In: Proceedings of the 32nd annual symposium on Foundations of Computer Science, pp. 197\u2013206. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"9170_CR41","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0925-7721(91)90012-4","volume":"1","author":"R. Seidel","year":"1991","unstructured":"Seidel, R.: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. 1, 51\u201364 (1991)","journal-title":"Comput. Geom."},{"issue":"5","key":"9170_CR42","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF02574699","volume":"6","author":"R. Seidel","year":"1991","unstructured":"Seidel, R.: Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6(5), 423\u2013434 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"9170_CR43","series-title":"Algorithms Combin.","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-58043-7_3","volume-title":"New Trends in Discrete and Computational Geometry","author":"R. Seidel","year":"1993","unstructured":"Seidel, R.: Backwards analysis of randomized geometric algorithms. In: New Trends in Discrete and Computational Geometry. Algorithms Combin., vol. 10, pp. 37\u201367. Springer, Berlin (1993)"},{"issue":"4\u20135","key":"9170_CR44","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/BF01940876","volume":"16","author":"R. Seidel","year":"1996","unstructured":"Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica 16(4\u20135), 464\u2013497 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"9170_CR45","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0201016","volume":"1","author":"G.S. Shedler","year":"1972","unstructured":"Shedler, G.S., Tung, C.: Locality in page reference strings. SIAM J. Comput. 1(3), 218\u2013241 (1972)","journal-title":"SIAM J. Comput."},{"key":"9170_CR46","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/258734.258775","volume-title":"SIGGRAPH \u201997: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques","author":"E. Veach","year":"1997","unstructured":"Veach, E., Guibas, L.J.: Metropolis light transport. In: SIGGRAPH \u201997: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, pp. 65\u201376. ACM\/Addison-Wesley, New York (1997)"},{"issue":"12","key":"9170_CR47","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1177\/0278364906072769","volume":"25","author":"C. Wellington","year":"2006","unstructured":"Wellington, C., Courville, A., Stentz, A.T.: A generative model of terrain for autonomous navigation in vegetation. Int. J. Rob. Res. 25(12), 1287\u20131304 (2006)","journal-title":"Int. J. Rob. Res."},{"key":"9170_CR48","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E. Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: New Results and New Trends in Computer Science, Graz, 1991. Lecture Notes in Comput. Sci., vol. 555, pp. 359\u2013370. Springer, Berlin (1991)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9170-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-009-9170-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9170-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:37Z","timestamp":1559087257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-009-9170-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,28]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9170"],"URL":"https:\/\/doi.org\/10.1007\/s00454-009-9170-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,28]]}}}