mirror of https://github.com/CGAL/cgal
48 lines
1.8 KiB
C++
48 lines
1.8 KiB
C++
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
|
#include <CGAL/Polygon_2.h>
|
|
#include <CGAL/Constrained_Delaunay_triangulation_2.h>
|
|
#include <CGAL/Polyline_constrained_triangulation_2.h>
|
|
#include <CGAL/Polyline_simplification_2/simplify.h>
|
|
#include <CGAL/Polyline_simplification_2/Squared_distance_cost.h>
|
|
|
|
namespace PS = CGAL::Polyline_simplification_2;
|
|
|
|
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
|
|
typedef CGAL::Polygon_2<K> Polygon_2;
|
|
|
|
typedef CGAL::Polyline_constrained_triangulation_vertex_base< CGAL::Triangulation_vertex_base_2< K > > Vb;
|
|
typedef CGAL::Triangulation_data_structure_2<Vb, CGAL::Constrained_triangulation_face_base_2<K> > TDS;
|
|
typedef CGAL::Constrained_Delaunay_triangulation_2<K, TDS, CGAL::Exact_predicates_tag> CDT;
|
|
typedef CGAL::Polyline_constrained_triangulation_2<CDT> PCT;
|
|
typedef PCT::Point Point;
|
|
typedef PCT::Constraint_iterator Constraint_iterator;
|
|
typedef PCT::Vertices_in_constraint_iterator Vertices_in_constraint_iterator;
|
|
typedef PCT::Points_in_constraint_iterator Points_in_constraint_iterator;
|
|
typedef PS::Stop_below_count_ratio_threshold Stop;
|
|
typedef PS::Squared_distance_cost Cost;
|
|
|
|
int main( )
|
|
{
|
|
PCT pct;
|
|
Polygon_2 P;
|
|
while(std::cin >> P){
|
|
pct.insert_constraint(P);
|
|
}
|
|
PS::mark_vertices_unremovable(pct);
|
|
PS::simplify(pct, Cost(), Stop(0.5));
|
|
|
|
for(Constraint_iterator cit = pct.constraints_begin();
|
|
cit != pct.constraints_end();
|
|
++cit) {
|
|
std::cout << "simplified polyline" << std::endl;
|
|
for(Vertices_in_constraint_iterator vit =
|
|
pct.vertices_in_constraint_begin(*cit);
|
|
vit != pct.vertices_in_constraint_end(*cit);
|
|
++vit)
|
|
std::cout << vit->point() << std::endl;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|