Adam Wulkiewicz

I would not worry about the uniqueness. I think we should return the first found closest pair without any additional guarantees. This will allow us to implement the algorithm of...

Could you elaborate and maybe show some example? Currently a coordinate system of a geometry is defined in compile-time as a part of the corresponding point type. Technically speaking `bg::traits::coordinate_system`...

In case you didn't know. It is possible to create `matrix_transformer` [1] and pass it into `bg::transform()` [2]. It is also possible to pass corresponding Boost.QVM [3] matrix into `matrix_transformer`...

Yes, `satisfies` predicate is only applied to Values. It is not a spatial predicate. It is possible to perform such query by implementing a new class like `LineBoundedSpace` and then...

No, it is not required to touch anything in detail. You only has to overload: ``` namespace boost { namespace geometry { inline bool intersects(rtree_t::bounds_type const& box, MyLine const& l)...

Yes, the compiler has problems with picking the overloads. It chooses to instantiate the original `bg::intersects` template, as mentioned here: https://stackoverflow.com/questions/19490435/boost-geometry-spatial-query-shapes and fails to do it. To force it to...

So we'd need a separate function for that. We should also probably do it for `M`. The problem is currently we are unable between distinguishing between coordinates, measures, time, etc....

It looks ok, i.e. in core of the library pointers are handled in a similar way. However pointer types are not tested in general so it is possible that in...

Thanks for this report. AFAIR the assumption was that the indexable is stored inside an object of type `value_type` and returned by reference. It's because this may be done quite...

Thanks for this PR @dkondor ! There are problems with it though. Your comment is probably not going to be visible in the documentation. Have you [built the docs](https://github.com/boostorg/geometry/wiki/Generating-and-Improving-Documentation) and...