From f7405c8f96b544c8ff7caaa1beaed09fe8febee7 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?= Date: Wed, 23 Aug 2017 16:26:14 +0200 Subject: [PATCH] Cleaned example: ex_periodic_alpha_shapes_2.cpp --- .../ex_periodic_alpha_shapes_2.cpp | 25 +++++++++---------- 1 file changed, 12 insertions(+), 13 deletions(-) diff --git a/Alpha_shapes_2/examples/Alpha_shapes_2/ex_periodic_alpha_shapes_2.cpp b/Alpha_shapes_2/examples/Alpha_shapes_2/ex_periodic_alpha_shapes_2.cpp index 9fbdfe75a00..7cb9a1243e0 100644 --- a/Alpha_shapes_2/examples/Alpha_shapes_2/ex_periodic_alpha_shapes_2.cpp +++ b/Alpha_shapes_2/examples/Alpha_shapes_2/ex_periodic_alpha_shapes_2.cpp @@ -4,30 +4,29 @@ #include #include +#include +#include #include #include // Traits typedef CGAL::Exact_predicates_inexact_constructions_kernel K; -typedef CGAL::Periodic_2_Delaunay_triangulation_traits_2 PK; - -// Exactness tag -typedef CGAL::Tag_false Exactness_tag; +typedef CGAL::Periodic_2_Delaunay_triangulation_traits_2 Gt; // Vertex type -typedef CGAL::Periodic_2_triangulation_vertex_base_2 Vb; -typedef CGAL::Alpha_shape_vertex_base_2 AsVb; +typedef CGAL::Periodic_2_triangulation_vertex_base_2 Vb; +typedef CGAL::Alpha_shape_vertex_base_2 AsVb; // Cell type -typedef CGAL::Periodic_2_triangulation_face_base_2 Cb; -typedef CGAL::Alpha_shape_face_base_2 AsCb; +typedef CGAL::Periodic_2_triangulation_face_base_2 Cb; +typedef CGAL::Alpha_shape_face_base_2 AsCb; typedef CGAL::Triangulation_data_structure_2 Tds; -typedef CGAL::Periodic_2_Delaunay_triangulation_2 P2DT2; -typedef CGAL::Alpha_shape_2 Alpha_shape_2; +typedef CGAL::Periodic_2_Delaunay_triangulation_2 P2DT2; +typedef CGAL::Alpha_shape_2 Alpha_shape_2; -typedef PK::Point_2 Point; -typedef PK::Segment_2 Segment; +typedef Gt::Point_2 Point; +typedef Gt::Segment_2 Segment; typedef Alpha_shape_2::Alpha_shape_edges_iterator Alpha_shape_edges_iterator; template @@ -65,7 +64,7 @@ int main() return -1; // Define the periodic square - P2DT2 pdt(PK::Iso_rectangle_2(-10,-10, 700,700)); + P2DT2 pdt(Gt::Iso_rectangle_2(-10,-10, 700,700)); // Heuristic for inserting large point sets (if pts is reasonably large) pdt.insert(points.begin(), points.end(), true);