Skip to content
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.

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

Spatial Join between a point and a set of polylines #1728

Draft
wants to merge 27 commits into
base: master
Choose a base branch
from
Draft
Changes from 1 commit
Commits
Show all changes
27 commits
Select commit Hold shift + click to select a range
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
Prev Previous commit
Next Next commit
Refined timings.
Signed-off-by: Johannes Kalmbach <johannes.kalmbach@gmail.com>
  • Loading branch information
joka921 committed Jan 23, 2025
commit e1543e34e43a8697f8c6ae359c4085106d3b0741
2 changes: 1 addition & 1 deletion src/engine/SpatialJoinAlgorithms.cpp
Original file line number Diff line number Diff line change
@@ -325,7 +325,6 @@ Result SpatialJoinAlgorithms::S2PointPolylineAlgorithm() {
t2.reset();
// Use the index to lookup the points of the other table
for (size_t searchRow = 0; searchRow < searchTable->size(); searchRow++) {
t.cont();
auto p = getPoint(searchTable, searchRow, searchJoinCol);
if (!p.has_value()) {
continue;
@@ -340,6 +339,7 @@ Result SpatialJoinAlgorithms::S2PointPolylineAlgorithm() {
auto s2target = S2ClosestEdgeQuery::PointTarget{toS2Point(p.value())};

ad_utility::HashMap<size_t, double> deduplicatedSet{};
t.cont();
for (const auto& neighbor : s2query.FindClosestEdges(&s2target)) {
// In this loop we only receive points that already satisfy the given
// criteria