See this document in CiteSeerX!

Efficient Searching with Linear Constraints (Extended Abstract)  (Make Corrections)  
Pankaj K. Agarwal, Lars Arge, et al.



  Home/Search   Context   Related

 
View or download:
dis.uniroma1.it/pu...EffSeaLinCon.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  dis.uniroma1.it...replist_by_year (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: ) Pankaj K. Agarwal Lars Arge y Jeff Erickson z Paolo G. Franciosa x Jeffrey Scott Vitter -- Abstract We show how to preprocess a set S of points in R d to get an external memory data structure that efficiently supports linear-constraint queries. Each query is in the form of a linear constraint a \Delta x b; the data structure must report all the points of S that satisfy the query. Our goal is to minimize the number of disk blocks required to store the data structure and the... (Update)

Similar documents (at the sentence level):
53.0%:   Efficient Searching with Linear Constraints (Extended Abstract) - Agarwal, al.   (Correct)
27.2%:   Efficient Searching with Linear Constraints - Agarwal, Arge, Erickson.. (1998)   (Correct)

Active bibliography (related documents):   More   All
0.7:   External Memory Data Structures - Arge (2000)   (Correct)
0.7:   Geometric Range Searching and Its Relatives - Agarwal, Erickson (1999)   (Correct)
0.5:   A Randomized Algorithm for Triangulating a Simple Polygon .. - Amato, Goodrich, Ramos (2000)   (Correct)

Similar documents based on text:   More   All
0.3:   Analysis of Half-Space Range Search Using the k-d Search Skip.. - Lopez, Nickerson   (Correct)
0.2:   On the complexity of Halfspace Area Queries - Langerman (2001)   (Correct)
0.1:   Practical Techniques for Constructing Binary Space.. - Agarwal, Murali, Vitter (1997)   (Correct)

BibTeX entry:   (Update)

@misc{ agarwal-efficient,
  author = "Pankaj K. Agarwal and Lars Arge and et al.",
  title = "Efficient Searching with Linear Constraints (Extended Abstract)",
  url = "citeseer.ist.psu.edu/391042.html" }
Citations (may not include all citations):
837   Cambridge University Press (context) - Motwani, Raghavan - 1995
765   trees: A dynamic index structure for spatial searching (context) - Guttman - 1985
516   tree: An efficient and robust access method for points and r.. (context) - Beckmann, Kriegel et al. - 1990
335   Applications of random sampling in computational geometry - Clarkson, Shor - 1989
233   tree: A dynamic index for multi-dimensional objects - Sellis, Roussopoulos et al. - 1987
229   Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
198   Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
144   symmetric multikey file structure (context) - Nievergelt, Hinterberger et al. - 1984
133   Geometric range searching and its relatives - Agarwal, Erickson - 1997
130   tree: A search structure for large multidimensional dynamic .. (context) - Robinson - 1984
121   A cost model for nearest neighbor search in high-dimensional.. (context) - Berchtold, Bohm et al. - 1997
121   External-memory computational geometry - Goodrich, Tsay et al. - 1993
103   Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1996
92   An introduction to spatial database systems (context) - Guting - 1994
91   Epsilon-nets and simplex range queries (context) - Haussler, Welzl - 1987
88   The hB-tree: A multiattribute indexing method with good guar.. (context) - Lomet, Salzberg - 1990
83   tree using fractals (context) - Kamel, Faloutsos et al. - 1994
72   Efficient partition trees (context) - Matousek - 1992
69   Filtering search: A new approach to query-answering (context) - Chazelle - 1986
62   Optimal dynamic interval management in external memory - Arge, Vitter - 1996
58   Reporting points in halfspaces (context) - Matousek - 1992
53   Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994
48   range tree: A new data structure for range searching in seco.. (context) - Subramanian, Ramaswamy - 1995
40   Geometric range searching - Matousek - 1994
37   Constructing belts in two-dimensional arrangements with appl.. (context) - Edelsbrunner, Welzl - 1986
30   A qualitative comparison study of data structures for large .. - Hoel, Samet - 1992
30   On levels in arrangements of lines (context) - Agarwal, Aronov et al. - 1997
27   Spatial data structures: Concepts and design choices (context) - Nievergelt, Widmayer - 1997
22   range searching in external memory (context) - Vengroff, Vitter et al. - 1996
22   Halfspace range search: An algorithmic application of k-sets (context) - Chazelle, Preparata - 1986
21   the decidability of semi-linearity for semi-algebraic sets a.. (context) - Dumortier, Gyssens et al. - 1997
21   Polygon retrieval (context) - Willard - 1982
19   Processing queries by linear constraints - Goldstein, Ramakrishnan et al. - 1997
18   The Design and Analyses of Spatial Data Structures (context) - Samet - 1989
15   New upper bounds for neighbor searching (context) - Chazelle, Cole et al. - 1986
13   Improving the performance of multi-dimensional access struct.. (context) - Henrich - 1996
12   Improved bounds for k-sets and k-th levels (context) - Dey - 1997
8   sets and fast halfplane search on paged memory (context) - Franciosa, Talamo et al. - 1994
7   tree: An index structure for higher dimensional data (context) - Berchtold, Keim et al. - 1996
6   Time optimal halfplane search on external memory (context) - Franciosa, Talamo - 1997
5   The hb -tree: a multi-attribute index supporting concurrency (context) - Evangelidis, Lomet et al. - 1997
4   OOBD indexing by class division (context) - Ramaswamy, Kanellakis - 1995
2   Constructing levels in arrangements and higher order Voronoi.. (context) - Agarwal, de Berg et al. - 1994
1   Intersection queries in curved objects (context) - Agarwal, van Kreveld et al. - 1993

Documents on the same site (http://www.dis.uniroma1.it/~alcom-it/AlcomArchive/replist_by_year.html):   More
An Improved Linear Time Algorithm for Minimal Elimination.. - Dahlhaus   (Correct)
A Hierarchical Adaptive Distributed Algorithm for.. - Antonis..   (Correct)
Dynamically Switching Vertices in Planar Graphs - Frigioni, Italiano (1999)   (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