Is CGAL Polyline simplification non-deterministic?
I’m trying to simplify many Polygon_with_holes_2
, some with shared boundaries. I noticed that when running the following C++ code snippet, I get different results during different runs (i.e. the number of points after Simplification is different for different runs with the same geometry).
Is CGAL Polyline simplification non-deterministic?
I’m trying to simplify many Polygon_with_holes_2
, some with shared boundaries. I noticed that when running the following C++ code snippet, I get different results during different runs (i.e. the number of points after Simplification is different for different runs with the same geometry).
Is CGAL Polyline simplification non-deterministic?
I’m trying to simplify many Polygon_with_holes_2
, some with shared boundaries. I noticed that when running the following C++ code snippet, I get different results during different runs (i.e. the number of points after Simplification is different for different runs with the same geometry).
Is CGAL Polyline simplification non-deterministic?
I’m trying to simplify many Polygon_with_holes_2
, some with shared boundaries. I noticed that when running the following C++ code snippet, I get different results during different runs (i.e. the number of points after Simplification is different for different runs with the same geometry).
Assertion violation for certain halfspace intersections using CGAL’s `Nef_polyhedron_3`
I’m seeing some assertion violations regarding certain halfspace
intersections computed using CGAL’s Nef_polyhedron_3
.