Magne Sjaastad 6b96df134e #14806 Cell search tree: Group cells in leaves and store leaf ids in flat arrays ...

Building the cell search tree was dominated by one small std::vector<int>
allocation per leaf, and a tree with one cell per leaf becomes very deep for
large grids.

- BoundingBoxTree: Store leaf ids in flat arrays, and move the input data
  instead of copying it. The tree shape is unchanged. Queries no longer copy
  the ids of each leaf.
- RigMainGrid: Always group at least 8 cells along K in each leaf.
  findIntersectingCells() removes cells not intersecting the query bounding
  box, so the result is the same set of cells as for a tree with one cell per
  leaf. This also applies to very large grids, which previously got the
  cells of the whole leaf.
- Include cells of nested LGRs and LGR cells in invalid main grid cells in
  the grouped tree, as the previous tree with one cell per leaf did.

2026-10-03 07:57:03 +02:00

..

AppFwk

Add Polygons data from Cloud (#14811)

2026-09-30 18:16:00 +02:00

VizFwk

#14806 Cell search tree: Group cells in leaves and store leaf ids in flat arrays

2026-10-03 07:57:03 +02:00

CMakeLists.txt

#14654 Fix Linux Release build defining NO_DEBUG instead of NDEBUG

2026-09-14 14:17:33 +02:00