boost-polygon

Is there a simple way to find out if a point is inside a voronoi cell? For example, the following code generates something like the diagram below: using namespace boost::polygon; point_data<int> p1(0, 0); point_data<int> p2(-10, 10); point_data<int> p3(-10, -10); point_data<int> p4(10, -10); point_data<int> p5(10, 10); std::vector<point_data<int>> pts = { p1, p2, p3, p4, p5 }; construct_voronoi(pts.begin(), pts.end(), vd); In this case, how can I found out if the point (5,5) is inside the central cell? I could create a polygon out of each cell and find out using a point in polygon algorithm ,

What is the best way to triangulate a polygon with Boost? I use Boost.polygon . My current algorithm: Compute a voronoï diagram from my polygon vertices. Create one directed polygon-edge for each cell-edge (this will create two directed polygon edge per cell-edge) Iterate over all created edges to create triangles (not trivial) Any better solution? Edit: I just realized that it is probably possible to walk through the cells in a special way to create the triangles directly (3 neighbor cells create a triangle). Giovanni Funchal The main idea is to iterate through the Voronoi vertices, and

I am using GCC 4.7.2 and Boost 1.58.0 on SUSE Enterprise Linux 11. I have the following code snippet which basically goes through a list of polygons to compute their length/width. I'm seeing strange output when using the 'auto' keyword with the std::minmax function. To compare, I also declare a second variable where the types are explicitly declared (i.e., dim vs dim1). namespace gtl = boost::polygon; typedef gtl::polygon_90_data<int> LayoutPolygon; typedef gtl::rectangle_data<int> LayoutRectangle; static LayoutFeatureVec calc_stats(LayoutPolygonSet const& lp) { LayoutFeatureVec v;