Talk:Hilbert R-tree
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
Computer Science Project edit
I'm cleaning up some domain specific jargon, specifically I'm changing MBR to "Minimum Bounding Rectangle" to make the content more accessible for casual readers.
Backwards copy edit
 | This article is substantially duplicated by a piece in an external publication. Please do not flag this article as a copyright violation of the following source:
|
This is a bit ambiguous, but our copy dates from 2007, and Worldcat knows of no revisions of this book prior to 2008, nor can I find any other papers that might be a parent source for both. Google Books link --User:Joe Decker (talk) 21:49, 13 July 2012 (UTC)
Figure 2 edit
The article reads "Figure 2 illustrates the intuitive reasons why our Hilbert-based methods will result in good performance. The data is composed of points (the same points as given in Figure 1)." This sound as if fig. 2 contains the actual results of tree build on the sample points, but it does not. Is part of figure 2 missing? --2A02:6B8:0:3903:E52C:6F19:D6D6:61AF (talk) 09:26, 14 March 2016 (UTC)
Cleanup Template edit
I just removed the cleanup template, which did not have any cleanup reason attached, and was from 2008. The article looks decent to me. Anyone have specific cleanup requests? --YoavShapira (talk) 13:05, 2 February 2017 (UTC)