H. Edelsbrunner, "A new Approach to Rectangle Intersections, Part I," Int. J. Computer Mathematics 13 (1983), 209--219. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Path Caching: A Technique for Optimal External Searching.. - Ramaswamy, Subramanian (1994) (46 citations) (Correct)
Cost-based Unbalanced R-Trees - Ross, Sitzmann, Stuckey (2000) (1 citation) (Correct)
Cost-based Unbalanced R-Trees - Ross, Sitzmann, Stuckey (2000) (1 citation) (Correct)
The P-range tree: A new data structure for range searching.. - Subramanian, al. (1995) (Correct)
I/O-Efficient Join Algorithms for Temporal, Spatial, and.. - Ramaswamy, Suel (1996) (2 citations) (Correct)
Indexing for Data Models with Classes and Constraints - Ramaswamy (1994) (Correct)
Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993) (80 citations) (Correct)
Dynamic Algorithms in Computational Geometry - Chiang, Tamassia (1992) (54 citations) (Correct)
Path Caching: A Technique for Optimal External Searching - Ramaswamy, Subramanian (1994) (46 citations) (Correct)
Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993) (80 citations) (Correct)
The IBS-tree: A Data Structure for Finding All Intervals.. - Hanson, Chaabouni (1994) (1 citation) (Correct)
The Interval Skip List: A Data Structure for Finding All.. - Hanson, Johnson (1992) (6 citations) (Correct)
Selection Predicate Indexing for Active Databases Using.. - Hanson, Johnson (1996) (5 citations) (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