Searching for "Efficient Partition Trees." – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Efficient Partition Trees
- … or similar theorems are used to establish the existence of such schemes. The most efficient partition trees…
- Cited by 74 (8 self) – Add To MetaCart
-
Constructing Good Partitioning Trees
- … as important as size, and probably more important, in determining the efficiency of partitioning tree…
- Cited by 24 (1 self) – Add To MetaCart
-
New Algorithmic Results for Lines-in-3-Space Problems
- … partition trees. In Proceedings of the 7th A CM Symposium on Computational Geometw, pages 1 9, 1991. N…
- Add To MetaCart
-
Expected-Case Complexity of Approximate Nearest Neighbor Searching
- … be performed most efficiently on partition trees that use axisorthogonal splits. Briefly, the reason…
- Cited by 6 (2 self) – Add To MetaCart
-
Expected-Case Complexity of Approximate Nearest Neighbor Searching
- … be performed most efficiently on partition trees that use axisorthogonal splits. Briefly, the reason…
- Add To MetaCart
-
Partitioning Tree Image Representation and Generation from 3D Geometric Models
- … structure provided by the tree. We have come to realize that an efficient partitioning tree is one…
- Cited by 40 (1 self) – Add To MetaCart
-
Bibliography
- …. The R -tree: An efficient and robust access method for points and rectangles. In ACM SIGMOD Int. Conf…
- Add To MetaCart
Showing 1 through 7.
