-
Notifications
You must be signed in to change notification settings - Fork 157
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
Header-only quadtree_point_to_nearest_linestring #1005
Header-only quadtree_point_to_nearest_linestring #1005
Conversation
…tree-point-to-nearest-linestring
…tree-point-to-nearest-linestring
…-header-only-quadtree-point-to-nearest-linestring
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Very minor comments.
cpp/include/cuspatial/experimental/detail/algorithm/point_linestring_distance.cuh
Outdated
Show resolved
Hide resolved
cpp/include/cuspatial/experimental/detail/quadtree_point_to_nearest_linestring.cuh
Outdated
Show resolved
Hide resolved
cpp/include/cuspatial/experimental/detail/quadtree_point_to_nearest_linestring.cuh
Outdated
Show resolved
Hide resolved
} | ||
|
||
template <typename T, typename LinestringRef> | ||
inline __device__ T point_linestring_distance(vec_2d<T> const& point, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I wonder if we can simplify point_to_segment_distance_squared
in linestring.cuh
with this API?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yeah, I think it can be simplified, or factored in a way to maximize reuse.
/merge |
Description
Closes #986. Depends on #979.
Checklist