question about node split algorithm in rtree

21 Views Asked by At

I recently studied the rtree node splitting algorithm. Among the node splitting algorithms, I read an explanation about the Quadratic algorithm, but I cant still understand the explanation. The Quadratic algorithm aims to minimize the area of two nodes when splitting a node. I'm curious about how the pickseed algorithm is used to minimize the area of the two nodes when the node is split.

0

There are 0 best solutions below