{"year":"1983","quality_controlled":"1","volume":1,"date_published":"1983-01-01T00:00:00Z","intvolume":"         1","extern":"1","oa_version":"None","citation":{"chicago":"Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” In <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, 1:109–25. Elsevier, 1983.","apa":"Bucher, W., &#38; Edelsbrunner, H. (1983). On expected- and worst-case segment trees. In F. Preparata (Ed.), <i>Computational Geometry: Theory and Applications</i> (Vol. 1, pp. 109–125). Elsevier.","mla":"Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 109–25.","short":"W. Bucher, H. Edelsbrunner, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 109–125.","ama":"Bucher W, Edelsbrunner H. On expected- and worst-case segment trees. In: Preparata F, ed. <i>Computational Geometry: Theory and Applications</i>. Vol 1. Elsevier; 1983:109-125.","ieee":"W. Bucher and H. Edelsbrunner, “On expected- and worst-case segment trees,” in <i>Computational Geometry: Theory and Applications</i>, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 109–125.","ista":"Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees. In: Computational Geometry: Theory and Applications. Advances in Computing Research , vol. 1, 109–125."},"publist_id":"2823","author":[{"first_name":"W.","last_name":"Bucher","full_name":"Bucher, W."},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"}],"abstract":[{"lang":"eng","text":"The segment tree is a data structure for storing and maintaining a set of intervals on the real line. It has been used for an efficient algorithmic approach in a variety of geometric problems including the problem of deter-mining intersections among axis-parallel rectangles, computing the measure of a set of axis-parallel rectangles, and locating a point in a planar subdivision. A segment tree for n intervals requires 0(n) space in the best case and 0(n log n) space in the worst case. It is shown that segment trees require 0(n log n) space even in the expected case. Additionally, the worst-case upper bound on the space requirement of segment trees is improved over the previously known bound. Surprisingly, the space requirements in the expected and in the worst case differ only little. \r\n"}],"language":[{"iso":"eng"}],"editor":[{"full_name":"Preparata, Franco","last_name":"Preparata","first_name":"Franco"}],"type":"book_chapter","_id":"3562","date_created":"2018-12-11T12:03:58Z","month":"01","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-01-27T07:40:13Z","publication":"Computational Geometry: Theory and Applications","publisher":"Elsevier","title":"On expected- and worst-case segment trees","status":"public","page":"109 - 125","article_processing_charge":"No","alternative_title":["Advances in Computing Research "],"day":"01","publication_status":"published","main_file_link":[{"url":"http://pub.ist.ac.at/~edels/Papers/1983-B-01-ExpectedSegmentTrees.pdf"}]}