Algorithm - 2023.1 English

Vitis Libraries

Release Date
2023-12-20
Version
2023.1 English

There are n nodes (rectangles), and the center point of its i-th node is represented as (xi, yi). A parent node has at most r child nodes.

  1. Sort all nodes according to x.
Figure 1 STRTree sort by x
  1. Divide all nodes into sqrt (n/r) parts, each of which is sorted by y.
Figure 2 STRTree sort by y
  1. Every r nodes are merged into a new parent node.
  2. Repeat (1)~(3) until the number of parent nodes is 1.