R. A. Finkel and J. L. Bentley. Quad trees: A data structure for retrieval by composite key. Acta Informatica, 4(1):1--9, 1974. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Data Structures for Spatial Database Systems - Procopiuc (1997) (1 citation) (Correct)
.... above, when the rectangles are decomposed in equal parts (i.e. a regular decomposition) and was first used by Morton [54] and Klinger [47] Another variant, governed by the position of the input points rather than symmetry, is called point quadtree and was proposed by Finkel and Bentley [24]. The point quadtree can be viewed as being constructed iteratively by inserting the data points one by one. A search is performed first for each point. If it is not found, the point is stored in the leaf where the search stopped, and the rectangle corresponding to this leaf is split into four ....
R. A. Finkel and J. L. Bentley. Quad trees: A data structure for retrieval by composite key. Acta Informatica, 4(1):1--9, 1974.
Speeding Up Neighbour-Joining Tree Construction - Brodal, Fagerberg, al. (2003) (1 citation) (Correct)
No context found.
R. A. Finkel and J. L. Bentley. Quad trees: A data structure for retrieval by composite key. Acta Informatica, 4(1):1--9, 1974.
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