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
|
// Copyright (c) 1997-2001
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1.1/Optimisation_basic/include/CGAL/Optimisation/Construct_point_3.h $
// $Id: include/CGAL/Optimisation/Construct_point_3.h 08b27d3db14 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Sven Schoenherr <sven@inf.ethz.ch>
#ifndef CGAL_OPTIMISATION_CONSTRUCT_POINT_3_H
#define CGAL_OPTIMISATION_CONSTRUCT_POINT_3_H
#include <CGAL/Point_3.h>
#include <vector>
#include <functional>
#include <iterator>
namespace CGAL {
// Class declaration
// =================
template < class K >
class _Construct_point_3;
// Class interface
// ===============
template < class K_ >
class _Construct_point_3 {
public:
// self
typedef K_ K;
typedef _Construct_point_3<K> Self;
// types
typedef typename K::Point_3 Point;
// creation
_Construct_point_3( ) { }
// operations
template < class InputIterator >
Point
operator() ( int, InputIterator first, InputIterator last) const
{
InputIterator i(first);
typename K::RT x = *(i++);
typename K::RT y = *(i++);
typename K::RT z = *(i++);
typedef typename K::Construct_point_3 Construct_point_3;
Construct_point_3 construct_point_3 = K().construct_point_3_object();
if (i==last) {
return construct_point_3(x,y,z);
} else {
typename K::RT h = *(i++);
return construct_point_3(x,y,z,h);
}
}
};
} //namespace CGAL
#endif // CGAL_OPTIMISATION_CONSTRUCT_POINT_3_H
// ===== EOF ==================================================================
|
