Skip to content

precalculate leaf extents and define for Extents.jl #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
maxfreu merged 1 commit into from
Feb 16, 2025
Merged

precalculate leaf extents and define for Extents.jl #9

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 7 additions & 4 deletions src/SortTileRecursiveTree.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -25,13 +25,16 @@ end


struct STRLeafNode{E}
extents::E
extent::E
extents::Vector{E}
indices::Vector{Int}
end
STRLeafNode(extents::Vector, indices::Vector) =
STRLeafNode(foldl(Extents.union, extents), extents, indices)


GI.extent(n::STRNode) = n.extent
GI.extent(n::STRLeafNode) = foldl(Extents.union, n.extents)
Extents.extent(n::STRNode) = n.extent
Extents.extent(n::STRLeafNode) = n.extent


function Base.show(io::IO, tree::SortTileRecursiveTree.STRtree)
Expand All @@ -53,7 +56,7 @@ function leafnodes(geoms; nodecapacity=10)
S = ceil(Int, sqrt(P))
x_splits = Iterators.partition(sorted_extents, S * nodecapacity)

nodes = STRLeafNode{Vector{typeof(extents_indices[1][1])}}[]
nodes = STRLeafNode{typeof(extents_indices[1][1])}[]
for x_split in x_splits
perm = sortperm(x_split; by=(v -> ((v[1][2][1] + v[1][2][2]) / 2))) # [extent/index][dim][min/max] sort by y
sorted_split = x_split[perm]
Expand Down