On expected- and worst-case segment trees
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.
Download
No fulltext has been uploaded. References only!
Book Chapter
| Published
Author
Bucher, W.;
Edelsbrunner, HerbertIST Austria 
Book Editor
Preparata, Franco P
Series Title
Advances in Computing Research
Publishing Year
Date Published
1983-01-01
Book Title
Computational Geometry: Theory and Applications
Volume
1
Page
109 - 125
IST-REx-ID
Cite this
Bucher W, Edelsbrunner H. On expected- and worst-case segment trees. In: Preparata F, ed. Computational Geometry: Theory and Applications. Vol 1. Elsevier; 1983:109-125.
Bucher, W., & Edelsbrunner, H. (1983). On expected- and worst-case segment trees. In F. Preparata (Ed.), Computational Geometry: Theory and Applications (Vol. 1, pp. 109–125). Elsevier.
Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” In Computational Geometry: Theory and Applications, edited by Franco Preparata, 1:109–25. Elsevier, 1983.
W. Bucher and H. Edelsbrunner, “On expected- and worst-case segment trees,” in Computational Geometry: Theory and Applications, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 109–125.
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.
Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” Computational Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 109–25.
Link(s) to Main File(s)
Access Level
Closed Access
Google Scholar