Biased finger trees and three-dimensional layers of maxima: (preliminary version)

Authors:
Mikhail J. Atallah;Michael T. Goodrich;Kumar Ramaiyer
Affiliations:
Department of Computer Sciences, Purdue University, W. Lafayette, IN;Department of Computer Science, The Johns Hopkins University, Baltimore, MD;Department of Computer Science, The Johns Hopkins University, Baltimore, MD
Venue:
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Year:
1994

Citing 24
Cited 5

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and network algorithms

Data structures and network algorithms
Computational geometry: an introduction

Computational geometry: an introduction
Planar point location using persistent search trees

Communications of the ACM
Searching and sorting similar lists

Journal of Algorithms
Optimal point location in a monotone subdivision

SIAM Journal on Computing
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
A data structure for dynamic trees

Journal of Computer and System Sciences
Fully dynamic point location in a monotone subdivision

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
Dynamic trees and dynamic point location

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dynamic planar point location with optimal query time

IDTC Second international conference on Database theory
Dynamization of the trapezoid method for planar point location (extended abstract)

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Dynamic expression trees and their applications

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Dynamic point location in general subdivisions

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic plane graph

Journal of Algorithms
Dynamic ray shooting and shortest paths via balanced geodesic triangulations

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An optimal RAM implementation of catenable min double-ended queues

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
Design of Dynamic Data Structures

Design of Dynamic Data Structures
Data Structures and Algorithms

Data Structures and Algorithms
Localized search in sorted lists

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new representation for linear lists

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

Methods for achieving fast query times in point location data structures

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Three-Dimensional Layers of Maxima

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Optimal finger search trees in the pointer machine

Journal of Computer and System Sciences - STOC 2002
A fast algorithm for three-dimensional layers of maxima problem

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

Quantified Score

Hi-index	0.00

Visualization

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(nlogn) algorithm for the 3-dimensional layers-of-maxima problem and also obtain an improved method for dynamic point location.