Relative Content

Tag Archive for c++computational-geometrycgal

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).