(Enter summary)
Abstract: Given an initial rectangular range or k nearest neighbor (k-nn) query (using the L1 metric)
, we consider the problems of incrementally extending the query by increasing the size of
the range, or by increasing k, and reporting the new points incorporated by each extension.
Although both problems may be solved trivially by repeatedly applying a traditional range
query or L1 k-nn algorithm, such solutions do not minimize the overall time to process all
extensions. We present algorithms that... (Update)
Context of citations to this paper: More
.... sequences of axis aligned rectangular neighborhoods and algorithms for extending by nearest neighbors using polytope distance functions [7]. Here we consider the extending rectangular range reporting problem. In this extending neighborhood problem instance, neighborhoods are...
.... previous results and our results desicion tree model their time bound increases by a factor of O(log log n) Flatland and Stewart [12] present an algorithm for the first problem which runs in time O(n log n kn) in the algebraic decision tree model. Finally, a recent paper...
Cited by: More
Geometric Applications of Posets - Segal, Kedem (1998)
(Correct)
Extending Rectangular Range Reporting with Query Sensitive.. - Flatland, Stewart (1998)
(Correct)
Active bibliography (related documents): More All
0.5: Extending Range Queries and Nearest Neighbors - Robin Flatland Charles
(Correct)
0.2: On Bisectors for Convex Distance Functions in 3-Space - Icking, Klein, Lê.. (1999)
(Correct)
0.1: New Data Structures for Orthogonal Range Searching - Alstrup, Brodal, Rauhe (2000)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
R. Y. Flatland and C. V. Stewart. Extending range queries and nearest neighbors. To appear in Computational Geometry: Theory and Applications. http://citeseer.ist.psu.edu/751140.html More
@article{ flatland00extending,
author = "Robin Y. Flatland and Charles V. Stewart",
title = "Extending range queries and nearest neighbors",
journal = "Computational Geometry",
volume = "17",
number = "1-2",
pages = "3-24",
year = "2000",
url = "citeseer.ist.psu.edu/751140.html" }
Citations (may not include all citations):
109
Multidimensional divide and conquer (context) - Bentley - 1980
69
Filtering search: A new approach to query-answering (context) - Chazelle - 1986
59
A functional approach to data structures and its use in mult.. (context) - Chazelle - 1988
51
Voronoi diagrams based on convex distance functions (context) - Chew, Drysdale - 1985
43
Iterated nearest neighbors and finding minimal polytypes
- Eppstein, Erickson - 1994
42
algorithm for the all-nearest-neighbors problem (context) - Vaidya, log - 1989
25
Fractional cascading: II (context) - Chazelle, Guibas - 1986
25
Two-dimensional Voronoi diagrams in the L p -metric (context) - Lee - 1980
22
Simple algorithms for enumerating interpoint distances and f.. (context) - Dickerson, Drysdale et al. - 1992
17
New data structures for orthogonal range queries (context) - Willard - 1985
10
Linear space data structures for two types of range search (context) - Chazelle, Edelsbrunner - 1986
7
Voronoi diagrams of lines in 3-space under polyhedral convex..
- Chew, Kadem et al. - 1995
Documents on the same site (http://www.vision.cs.rpi.edu/publications.html): More
Disease-Oriented Evaluation of Dual-Bootstrap - Retinal Image Registration (2003)
(Correct)
A Feature-Based Technique for Joint, Linear.. - Can, Stewart.. (2001)
(Correct)
Model-Based Method for Improving the Accuracy - And Repeatability Of
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC