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
101
102
103
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/Circular_kernel_2/include/CGAL/Simple_circular_kernel_2.h $
// $Id: include/CGAL/Simple_circular_kernel_2.h b26b07a1242 $
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
//
// Author(s) : Monique Teillaud, Sylvain Pion, Julien Hazebrouck, Pedro Machado
// Partially supported by the IST Programme of the EU as a Shared-cost
// RTD (FET Open) Project under Contract No IST-2000-26473
// (ECG - Effective Computational Geometry for Curves and Surfaces)
// and a STREP (FET Open) Project under Contract No IST-006413
// (ACS -- Algorithms for Complex Shapes)
#ifndef CGAL_SIMPLE_CIRCULAR_KERNEL_2_H
#define CGAL_SIMPLE_CIRCULAR_KERNEL_2_H
#include <CGAL/license/Circular_kernel_2.h>
#if 0
#include <CGAL/Circular_arc_2.h>
#include <CGAL/Circular_arc_point_2.h>
#include <CGAL/Line_arc_2.h>
#include <CGAL/Circular_kernel_2/Circular_arc_point_2.h>
#include <CGAL/Circular_kernel_2/Circular_arc_2.h>
#include <CGAL/Circular_kernel_2/Line_arc_2.h>
#include <CGAL/Circular_kernel_type_equality_wrapper.h>
#include <CGAL/Circular_kernel_2/function_objects_polynomial_circular.h>
#include <CGAL/global_functions_circular_kernel_2.h>
#include <CGAL/Circular_kernel_2/function_objects_on_line_2.h>
#include <CGAL/Circular_kernel_2/function_objects_on_circle_2.h>
namespace CGAL {
namespace internal {
template < class CircularKernel, class LinearKernelBase, class AlgebraicKernel >
struct Circular_kernel_base_ref_count: public LinearKernelBase
{
typedef internal::Circular_arc_2<CircularKernel> Circular_arc_2;
typedef internal::Circular_arc_point_2<CircularKernel> Circular_arc_point_2;
typedef internal::Line_arc_2<CircularKernel> Line_arc_2;
typedef LinearKernelBase Linear_kernel;
typedef AlgebraicKernel Algebraic_kernel;
typedef typename Algebraic_kernel::Root_of_2 Root_of_2;
typedef typename Algebraic_kernel::Root_for_circles_2_2 Root_for_circles_2_2;
typedef typename Algebraic_kernel::Polynomial_for_circles_2_2
Polynomial_for_circles_2_2;
typedef typename Algebraic_kernel::Polynomial_1_2 Polynomial_1_2;
typedef typename Linear_kernel::RT RT;
typedef typename Linear_kernel::FT FT;
// The mechanism that allows to specify reference-counting or not.
template < typename T >
struct Handle { typedef T type; };
template < typename Kernel2 >
struct Base { typedef Circular_kernel_base_ref_count<Kernel2, LinearKernelBase, AlgebraicKernel> Type; };
#define CGAL_Circular_Kernel_pred(Y,Z) \
typedef CircularFunctors::Y<CircularKernel> Y; \
Y Z() const { return Y(); }
#define CGAL_Circular_Kernel_cons(Y,Z) CGAL_Circular_Kernel_pred(Y,Z)
#include <CGAL/Circular_kernel_2/interface_macros.h>
};
} // namespace internal
template < class LinearKernel, class AlgebraicKernel >
struct Circular_kernel_2
: public Circular_kernel_type_equality_wrapper
<
internal::Circular_kernel_base_ref_count
< Circular_kernel_2<LinearKernel,AlgebraicKernel>,
typename LinearKernel:: template
Base<Circular_kernel_2<LinearKernel,AlgebraicKernel> >::Type,
AlgebraicKernel
>,
Circular_kernel_2<LinearKernel,AlgebraicKernel>
>
{
// for Lazy hexagons/bbox kernels
// Please remove this if you consider it to be sloppy
struct Circular_tag{};
typedef Circular_tag Definition_tag;
//
};
} //namespace CGAL
#endif
#endif // CGAL_SIMPLE_CIRCULAR_KERNEL_2_H
|
