Vissarion Fisikopoulos

I can reproduce the issue. Thanks. The algorithm incorrectly generates the intersection segments using the computed intersection points and the original endpoints of the input segment. Note that if you...

Fixed by https://github.com/boostorg/geometry/pull/1263

fixed by https://github.com/boostorg/geometry/pull/1080

Please let me know if this is fixed after merging PR https://github.com/boostorg/geometry/pull/1177

I can reproduce it. This is a missing combination, with a simple workaround though.

Could you please provide a minimal code example and explain the issue in more details. I am afraid I cannot fully understand your problem with the current description.

OK, I see your point now, thanks for clarifications. I think a simpler choice from what you propose is to change `correct` to do nothing for the ordering of non-cartesian...

OK, my proposal above was not correct. The main issue here is that Boost.Geometry does not support polygons that cover more than half of the spheroid. So if one gives...

OK I think you have to face this feature (Boost.Geometry does not support polygons that cover more than half of the spheroid) as a limitation. I agree that one can...

```cpp #include #include #include #include #include #include namespace bg = boost::geometry; using SphericalPoint = bg::model::d2::point_xy; using SphericalPolygon = boost::geometry::model::polygon; int main() { SphericalPolygon quad {{{0,0}, {0,1}, {1,1}, {1,0}, {0,0}}}; SphericalPoint...