1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
// Copyright (c) 2003,2004,2005,2006 INRIA Sophia-Antipolis (France).
// 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.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
// SPDX-License-Identifier: GPL-3.0+
//
//
// Author(s) : Menelaos Karavelas <mkaravel@iacm.forth.gr>
#ifndef CGAL_SEGMENT_DELAUNAY_GRAPH_2_KERNEL_WRAPPER_2_H
#define CGAL_SEGMENT_DELAUNAY_GRAPH_2_KERNEL_WRAPPER_2_H
#include <CGAL/license/Segment_Delaunay_graph_2.h>
#include <CGAL/Segment_Delaunay_graph_2/basic.h>
#include <CGAL/Segment_Delaunay_graph_2/Constructions_C2.h>
#include <CGAL/Segment_Delaunay_graph_site_2.h>
#include <CGAL/Segment_Delaunay_graph_simple_site_2.h>
namespace CGAL {
namespace SegmentDelaunayGraph_2 {
namespace Internal {
template<class K, class ITag> struct SDG_Which_site;
// If the ITag is Tag_true we fully support intersections and
// therefore we need the full-fletched site.
template<class K>
struct SDG_Which_site<K,Tag_true>
{
typedef K Kernel;
typedef Tag_true Intersections_tag;
typedef CGAL::Segment_Delaunay_graph_site_2<K> Site_2;
typedef Construct_sdg_site_2<Site_2,Intersections_tag>
Construct_site_2;
};
// If the ITag is Tag_false we are happy with the simple site.
template<class K>
struct SDG_Which_site<K,Tag_false>
{
typedef K Kernel;
typedef Tag_false Intersections_tag;
typedef CGAL::Segment_Delaunay_graph_simple_site_2<K> Site_2;
typedef Construct_sdg_site_2<Site_2,Intersections_tag>
Construct_site_2;
};
} // namespace Internal
template<class Kernel_base_2, class ITag>
class Kernel_wrapper_2
: public Kernel_base_2
{
public:
typedef Kernel_base_2 Kernel_base;
typedef ITag Intersections_tag;
typedef typename
Internal::SDG_Which_site<Kernel_base,Intersections_tag>::Site_2 Site_2;
typedef typename
Internal::SDG_Which_site<Kernel_base,Intersections_tag>::Construct_site_2
Construct_site_2;
};
} //namespace SegmentDelaunayGraph_2
} //namespace CGAL
#endif // CGAL_SEGMENT_DELAUNAY_GRAPH_2_KERNEL_WRAPPER_2_H
|
