Jdev's R-Tree

Fragment of a discussion from User talk:Jdev
Jump to navigation Jump to search

Here is that discussion

Jdev (talk)09:39, 18 September 2014

What do CHILDREN_COUNT, and RTreeEntry, each do? Can they be optimized like bucket size? Do you see any optimizations to the R-tree Jdev?

Tmservo (talk)10:06, 18 September 2014

CHILDREN_COUNT - it's split factor, or how many subrectangles will be generated, when current rectangle are overflowed
RTreeEntry... hmmmm... it's entry of range search tree:) It represents data point in turn snapshots space and thing that are added to tree and search for which tree are used.
I think, that CHILDREN_COUNT can be optimised for particular spaces based on theirs natures
I don't know. It was 4 years ago and i do not remember anything

Jdev (talk)10:18, 18 September 2014

Here's some words to use ctrl f on to help you remember

Rtree 
CHILDREN_COUNT 
RTree parent 
Attribute[] 
dimensions 
IntervalDouble[] 
coveredRange 
RTreeEntry[32] 
RTreeEntry[] 
entries
nextEntryIdx
RTree[] 
children
nextChild
Intersection 
intersection
splitDimensionIdx
singular
entryCount
TurnSnapshot
location
Tmservo (talk)10:36, 18 September 2014