Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a22afdad7d9cd937

Jump to content

Talk:R-tree

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 2 years ago by Effervecent in topic Linear data?

Linear data?

[edit]

I don't like the use of the term 'linear data' because although the meaning 'like a line' is accurate, it also means something different in mathematics. I propose something like 'scalar data' instead. Effervecent (talk) 11:36, 6 October 2023 (UTC)Reply

Priority R-Tree

[edit]

I think the priority R-trees would fit more into r-tree bulk-loading algorihms. As I understand the PR-tree it is very good variant of bulk-loading algorithm.— Preceding unsigned comment added by 212.47.3.98 (talk) 12:41, 7 July 2006

Yes, as I understand it, it is bulk loading only. So I moved it there. --Chire (talk) 15:01, 8 October 2011 (UTC)Reply

Illustration Request

[edit]

Is the illustration right? I think R6 and R7 are switched?— Preceding unsigned comment added by 130.108.237.126 (talk) 07:42, 19 November 2006

Definitely an error, values for R6 and R7 are switched. —The preceding unsigned comment was added by 193.1.172.104 (talk) 09:31, 12 December 2006 (UTC).Reply
This has been fixed in 2007, in the previous version of the image, see: File:R-tree.jpg. --Chire (talk) 15:01, 8 October 2011 (UTC)Reply

Illustration Validity?

[edit]

Isn't this illustrating an interval tree? If each rectangles had points, then it would make it simpler to undertsand imo— Preceding unsigned comment added by 67.127.184.86 (talk) 09:55, 4 March 2008

An R-Tree can store points, rectangles, polygons (via their MBR) ... The term "interval tree" is commonly used for a tree storing 1d intervals using a 2d index structure, where then an interval is represented by a point. --Chire (talk) 07:28, 4 October 2011 (UTC)Reply
[edit]

The "containment" example of a searching algorithm link points to an interesting but somewhat irrelevant article on "the foreign policy strategy of the United States" —Preceding unsigned comment added by 62.49.247.83 (talk) 13:35, 8 March 2008 (UTC)Reply

Similarity to multi-dimensional enfilades

[edit]

Interesting. I wonder if there is a similarity with Project Xanadu's enfilades. — Preceding unsigned comment added by Mpe (talkcontribs) 14:22, 4 March 2010