Abstract
We prove four results on randomized incremental constructions (RICs): an analysis of the expected behavior under insertion and deletions, a fully dynamic data structure for convex hull maintenance in arbitrary dimensions, a tail estimate for the space complexity of RICs, a lower bound on the complexity of a game related to RICs.
Cite
CITATION STYLE
APA
Clarkson, K. L., Mehlhorn, K., & Seidel, R. (1992). Four results on randomized incremental constructions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 577 LNCS, pp. 463–474). Springer Verlag. https://doi.org/10.1007/3-540-55210-3_205
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free