O. Procopiuc, P.K. Agarwal, L. Arge, and J.S. Vitter. Bkd-tree: A dynamic scalable kd-tree. Submitted for publication, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Priority R-Tree: A Practically Efficient and.. - Arge, de Berg.. (2004) Self-citation (Arge) (Correct)
No context found.
O. Procopiuc, P. K. Agarwal, L. Arge, and J. S. Vitter. Bkd-tree: A dynamic scalable kd-tree. In Proc. International Symposium on Spatial and Temporal Databases, 2003.
Cache-Oblivious Data Structures for Orthogonal Range.. - Agarwal, Arge.. Self-citation (Agarwal Arge) (Correct)
.... supports updates in O( log B N log B log B N ) memory transfers [8] If only linear space is used, O( T B) is a lower bound on the number of transfers needed to answer a query, and these bounds are obtained by the kd B tree [25] The kd B tree can be constructed in O(Sort(N) N ) I Os [1, 2], the number of I Os needed to sort N elements, and using the logarithmic method [15] this leads to an O( B log M B N B N) update algorithm. Refer to recent surveys for further I O model and hierarchical memory model results [6, 26] Frigo et al. 22] developed cache oblivious algorithms for ....
P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. Bkd-tree: A dynamic scalable kd-tree. Manuscript, 2002.
Implementing I/O-Efficient Data Structures Using TPIE - Arge, Procopiuc, Vitter (2002) (1 citation) Self-citation (Procopiuc Arge Vitter) (Correct)
.... Furthermore, just like a large number of batched algorithms were implemented in the first phase of the project, a large number of data structures have been implemented in the second phase, including B trees [12] persistent B trees [9] R trees [10] CRB trees [1] K D B trees [18] and Bkd trees [17]. The two parts of TPIE are highly integrated, allowing seamless implementation of algorithms and data structures that make use of both random and sequential access patterns. While the first part of TPIE has been described in a previous paper [19] this paper describes the design and ....
....properties, it produces a dynamic structure consisting of a set of smaller static indexes of geometrically increasing sizes. We implemented the external memory versions of this method, as proposed by Arge and Vahrenhold [8] and Agarwal et al. 2] More details on the implementation can be found in [17]. K D B tree. The K D B tree [18] combines the properties of the kd tree [11] and the B tree to handle multidimensional points in an external memory setting. Our implementation supports insertion, deletion, point query, range query and bulk loading. More details on the implementation can be found ....
[Article contains additional citation context not shown here]
O. Procopiuc, P. K. Agarwal, L. Arge, and J. S. Vitter. Bkd-tree: A dynamic scalable kd-tree. Manuscript, 2002.
FastSLAM: An Efficient Solution to the.. - Thrun.. (2004) (2 citations) (Correct)
No context found.
O. Procopiuc, P.K. Agarwal, L. Arge, and J.S. Vitter. Bkd-tree: A dynamic scalable kd-tree. Submitted for publication, 2002.
FastSLAM: A Factored Solution to the Simultaneous Localization.. - Montemerlo (2003) (44 citations) (Correct)
No context found.
O. Procopiuc, P. Agarwal, L Arge, and J. Vitter. Bkd-tree: A dynamic scalable kd-tree. Submitted for publication, 2002.
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