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
104
105
106
107
108
109
110
111
|
// Copyright (c) 2006-2010 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 Lesser 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: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/next/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Interval_evaluate_2.h $
// $Id: Interval_evaluate_2.h 67093 2012-01-13 11:22:39Z lrineau $
//
//
// Author(s) : Michael Kerber <mkerber@mpi-inf.mpg.de>
//
// ============================================================================
#ifndef CGAL_INTERVAL_EVALUATE_2
#define CGAL_INTERVAL_EVALUATE_2 1
#include <iterator>
#include <CGAL/basic.h>
#include <boost/numeric/interval.hpp>
#include <CGAL/algorithm.h>
#include <CGAL/array.h>
#include <CGAL/Coercion_traits.h>
#include <CGAL/Polynomial_traits_d.h>
#include <CGAL/Algebraic_kernel_d/Interval_evaluate_1.h>
namespace CGAL {
namespace internal {
template<typename Polynomial_2, typename Bound>
struct Interval_evaluate_2 : public std::binary_function
<Polynomial_2,CGAL::cpp0x::array<Bound,4>,
std::pair<typename CGAL::Coercion_traits<typename CGAL::Polynomial_traits_d<Polynomial_2>::Innermost_coefficient_type,Bound>::Type,
typename CGAL::Coercion_traits<typename CGAL::Polynomial_traits_d<Polynomial_2>::Innermost_coefficient_type,Bound>::Type> > {
public:
typedef CGAL::Polynomial_traits_d< Polynomial_2 > PT_2;
typedef typename PT_2::Innermost_coefficient_type Innermost_coefficient_type;
typedef CGAL::Coercion_traits< Innermost_coefficient_type, Bound > CT;
typedef typename CT::Type Coercion_type;
typedef std::pair< Coercion_type, Coercion_type > result_type;
result_type operator()(const Polynomial_2& p,
const CGAL::cpp0x::array< Bound, 4 >& b) const {
typename CT::Cast cast;
typedef ::boost::numeric::interval< Coercion_type > Coercion_interval;
typedef typename PT_2::Coefficient_const_iterator
Coefficient_const_iterator;
typedef typename PT_2::Coefficient_const_iterator_range
Coefficient_const_iterator_range;
typedef typename PT_2::Coefficient_type Polynomial_1;
CGAL::internal::Interval_evaluate_1< Polynomial_1,Bound >
interval_evaluate_1;
typedef typename CGAL::internal::Interval_evaluate_1< Polynomial_1,Bound >::
result_type Interval_result_type;
std::pair< Bound, Bound > x_pair = std::make_pair(b[0],b[1]);
Coercion_interval iy(cast(b[2]),cast(b[3]));
// CGAL::Polynomial does not provide Coercion_traits for number
// types => therefore evaluate manually
Coefficient_const_iterator_range range =
typename PT_2::Construct_coefficient_const_iterator_range()(p);
Coefficient_const_iterator it = CGAL::cpp0x::prev(range.second);
Interval_result_type initial_pair = interval_evaluate_1(*it,x_pair);
Coercion_interval res(initial_pair.first,initial_pair.second);
Coefficient_const_iterator p_begin = range.first;
while((it) != p_begin) {
it--;
Interval_result_type curr_iv = interval_evaluate_1(*it,x_pair);
res = res * iy + Coercion_interval(curr_iv.first,curr_iv.second);
}
return std::make_pair(res.lower(),res.upper());
}
};
} // namespace internal
} // namespace CGAL
#endif // CGAL_INTERVAL_EVALUATE_2
|
