Category : geometry

I’m working on a problem of inscribing largest circle in convex polygon. The algorithm should be O(nlogn) time complexity. I know that it’s been discussed on this forum, that the possible solution is using straight skeletons. I found simple algorithm, which find radius of the largest circle in O(nlogn). Link to page with algorithm http://e-maxx.ru/algo/inscribed_circle ..

Read more

I am trying to use boost geometry algorithms with my own custom polygon type. But I getting compiler errors (in Visual Studio 2019 Windows 10). I have simplified what I am trying to do into the following code. In my_custom_polygon.hpp #include <boost/geometry.hpp> #include <boost/geometry/geometries/geometries.hpp> using point = boost::geometry::model::d2::point_xy<double>; using ring = boost::geometry::model::ring<point>; struct MyPoly { ..

Read more