Searching for "Geometric Retrieval Problems" – sorted by Relevance.
8 documents found, showing 1 through 8.
-
Novel transformation techniques using q-heaps with applications to computational geometry
- … for the two fundamental geometric retrieval problems: orthogonal segment intersection and rectangular point…
- Cited by 1 (0 self) – Add To MetaCart
-
Fast fractional cascading and its applications
- … for the geometric retrieval problems: orthogonal segment intersection and rectangular point enclosure. The new…
- Cited by 4 (2 self) – Add To MetaCart
-
[XOK90] T. Hagerup and C. Rub. Optimal Merging and Sorting on the EREW PRAM. Technical Report, Universit/it des Saarlandes, 1989.
- … an Computing, 770-785, 1988. [CY85] R. Cole and C.K. Yap. Geometric retrieval problems. Information…
- Add To MetaCart
-
On the importance of idempotence
- …. These are the first lower bound results for any approximate geometric retrieval problems. The existence of nearly…
- Cited by 6 (3 self) – Add To MetaCart
-
Fractional cascading: I. A data structuring technique
- … these problems have in common? Except that they each fall into the broader class of geometric retrieval problems…
- Cited by 122 (5 self) – Add To MetaCart
-
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- …, . . . , qd) if pi ≥ qi for all i = 1, . . . , d. A number of geometric retrieval problems involving iso…
- Cited by 10 (1 self) – Add To MetaCart
-
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Range Counting
- … that no two points in S have the same x-, y-, or z-coordinates. A number of geometric retrieval problems…
- Add To MetaCart
-
Techniques for Indexing and Querying Temporal Observations for a Collection of Objects
- … retrieval problem. Each tuple v j i (v j i �tj i �sj i �ej i �oi) can be viewed as a rectangular plate in a…
- Add To MetaCart
Showing 1 through 8.
