Kumar Ramaiyer

Learn More
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can eeciently determine for a given query point p the rst segment(s) in S intersected by vertical rays emanating out from p. It is well known that linear-space data structures can be constructed so as to achieve O(log n) query times.(More)
The well-known B-tree data structure provides a mechanism for dynamically maintaining balanced binary trees in external memory. We present an external-memory dynamic data structure for maintaining arbitrary binary trees. Our data structure, which we call the topology B-tree, is an external-memory analogue to the internal-memory topol-ogy tree data structure(More)
The Sloan Digital Sky Survey is a photometric and spec-troscopic survey designed to digitally map the North Galactic Cap (steradians or 10; 000 deg 2) over a period of ve years. The photometric imaging will be done in ve broad bands (u 0 , g 0 , r 0 , i 0 , & z 0), to a limiting magnitude of g 0 23. From the photometric catalog, a sample of 10 6 galaxies(More)
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 <italic>O</italic>(<italic>n</italic>log<italic>n</italic>) algorithm for(More)
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 hee 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-dimcnsionallayers-of-maxima problem and(More)
  • 1