Hi,
I have lots of linestrings and want to find the k nearest linestrings to
some point.
Looking at the example
/libs/geometry/doc/index/src/examples/rtree/polygons_shared_ptr.cpp
I first thought this should be close to the solution and I just could
replace the polygons with linestrings. But now
Adam Wulkiewicz via Boost-users writes:
> W dniu 23.05.2021 o 17:33, Adam Wulkiewicz pisze:
>> W dniu 18.05.2021 o 09:34, Jens Thiele via Boost-users pisze:
>>> I have lots of linestrings and want to find the k nearest linestrings to
>>> some point.
>>>
Adam Wulkiewicz via Boost-users writes:
> W dniu 14.06.2021 o 11:33, Jens Thiele via Boost-users pisze:
>> Adam Wulkiewicz via Boost-users writes:
>>
>>> W dniu 23.05.2021 o 17:33, Adam Wulkiewicz pisze:
>>>> W dniu 18.05.2021 o 09:34, Jens Thiele via Boo
Adam Wulkiewicz via Boost-users writes:
> W dniu 14.06.2021 o 12:26, Jens Thiele pisze:
>> Adam Wulkiewicz via Boost-users writes:
>>
>>> Without knowing your code I can't esstimate if this is long time or
>>> not, I can only guess. In general qbegin() loop gathering some number
>>> of nearest e
Jens Thiele writes:
> https://github.com/boostorg/geometry/issues/867
added a test there to make it reproducible
Jens
___
Boost-users mailing list
Boost-users@lists.boost.org
https://lists.boost.org/mailman/listinfo.cgi/boost-users
Jens Thiele writes:
> Adam Wulkiewicz via Boost-users writes:
>
>> W dniu 23.05.2021 o 17:33, Adam Wulkiewicz pisze:
>>> I propose you to use query iterators instead of query function. Then
>>> you can iterate over nearest boxes (passing the number of values
>>> stored in the rtree into the near
Adam Wulkiewicz via Boost-users writes:
> W dniu 13.07.2021 o 17:04, Jens Thiele via Boost-users pisze:
>> Another problem I face now is that each run produces different results
>> which is still correct (multiple linestrings might have the same
>> distance to some point)
