Skip to content

Instantly share code, notes, and snippets.

View afabri's full-sized avatar

Andreas Fabri afabri

View GitHub Profile
#include <CGAL/Epick_d.h>
#include <CGAL/point_generators_d.h>
#include <CGAL/Delaunay_triangulation.h>
#include <CGAL/algorithm.h>
#include <CGAL/Timer.h>
#include <CGAL/assertions.h>
#include <CGAL/property_map.h>
#include <CGAL/Spatial_sort_traits_adapter_d.h>
#include <iostream>
@afabri
afabri / five.txt
Created November 27, 2019 08:22
Union of polygons with segments and circular arcs
-2 2 -2 14 -4 14 -4 2
-2 11 8 11 8 13 -2 13
0 2 12 2 12 8 0 8
2 9 5 12 3 14 0 11
9 0 9 12 7 12 7 0
#include <Eigen/Dense>
struct Base {
virtual Base* clone() const = 0;
};
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/boost/graph/graph_traits_Surface_mesh.h>
#include <CGAL/boost/graph/copy_face_graph.h>
#include <CGAL/subdivision_method_3.h>
#include <iostream>
#include <fstream>
#include <iostream>
#include <fstream>
#include <stdlib.h>
using std::cout; using std::endl;
#include "CGAL/Surface_mesh.h"
#include "CGAL/Surface_mesh_shortest_path.h"
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
typedef CGAL::Surface_mesh<Kernel::Point_3> Triangle_mesh;
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/convex_hull_3.h>
#include <CGAL/Extreme_points_traits_adapter_3.h>
#include <vector>
#include <fstream>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef K::Point_3 Point_3;
#include <cassert>
#include <vector>
// typedefs for the traits and the algorithm
#include <CGAL/Gmpq.h>
#include <CGAL/Segment_Delaunay_graph_2.h>
#include <CGAL/Segment_Delaunay_graph_adaptation_policies_2.h>
#include <CGAL/Segment_Delaunay_graph_adaptation_traits_2.h>
#include <CGAL/Segment_Delaunay_graph_filtered_traits_2.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
#include <CGAL/Bounded_kernel.h>
#include <CGAL/Nef_polyhedron_2.h>
#include <list>
typedef CGAL::Bounded_kernel<CGAL::Exact_predicates_exact_constructions_kernel> Extended_kernel;
typedef CGAL::Nef_polyhedron_2<Extended_kernel> Nef_polyhedron;
typedef Nef_polyhedron::Point Point; // a standard point
#include <CGAL/Epeck_d.h>
int main(){
typedef CGAL::Epeck_d<CGAL::Dimension_tag<2>> EK;
typedef typename EK::Vector_d V;
typedef typename EK::Construct_vector_d CV;
EK k;
CV cv = k.construct_vector_d_object();
@afabri
afabri / Pair_partition_traits_2.h
Created March 25, 2019 08:12
partition with information associated to the polygon vertices
// Copyright (c) 2000 Max-Planck-Institute Saarbruecken (Germany).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// You can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.