Skip to main content
Conference ProceedingsOPEN ACCESS

Biased finger trees and three-dimensional layers of maxima

Proceedings of the Annual Symposium on Computational Geometry (1994) 150-159
DOI: 10.1145/177424.177601
10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We present a method for maintaining biased search trees so as to support fast finger updates (i.e., updates in which one is given a pointer to the part of the tree being changed). We illustrate the power of such biased finger trees by showing how they can be used to derive an optimal O(n log n) algorithm for the 3-dimensional layers-of-maxima problem and also obtain an improved method for dynamic point location.

Cite

CITATION STYLE

APA

Atallah, M. J., Goodrich, M. T., & Ramaiyer, K. (1994). Biased finger trees and three-dimensional layers of maxima. In Proceedings of the Annual Symposium on Computational Geometry (pp. 150–159). Publ by ACM. https://doi.org/10.1145/177424.177601

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free