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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
// Copyright (c) 2000
// 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/Cartesian_kernel/include/CGAL/Cartesian/Point_3.h $
// $Id: include/CGAL/Cartesian/Point_3.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Andreas Fabri and Herve Bronnimann
#ifndef CGAL_CARTESIAN_POINT_3_H
#define CGAL_CARTESIAN_POINT_3_H
#include <CGAL/Origin.h>
namespace CGAL {
template < class R_ >
class PointC3
{
typedef PointC3<R_> Self;
typedef typename R_::Vector_3 Vector_3;
typedef typename R_::Point_3 Point_3;
typedef typename R_::Aff_transformation_3 Aff_transformation_3;
// We do not use reference counting here as it is done at the Vector_3 level.
Vector_3 base;
public:
typedef typename Vector_3::Cartesian_const_iterator Cartesian_const_iterator;
typedef R_ R;
typedef typename R_::FT FT;
PointC3() {}
PointC3(const Origin &)
: base(NULL_VECTOR) {}
template <class T1, class T2, class T3>
PointC3(T1 &&x, T2 &&y, T3 &&z)
: base(std::forward<T1>(x), std::forward<T2>(y), std::forward<T3>(z))
{}
template <class T1, class T2, class T3, class T4>
PointC3(T1 &&x, T2 &&y, T3 &&z, T4 &&w)
: base(std::forward<T1>(x), std::forward<T2>(y),
std::forward<T3>(z), std::forward<T4>(w))
{}
friend void swap(Self& a, Self& b)
#if !defined(__INTEL_COMPILER) && defined(__cpp_lib_is_swappable)
noexcept(std::is_nothrow_swappable_v<Vector_3>)
#endif
{
using std::swap;
swap(a.base, b.base);
}
const FT & x() const
{
return base.x();
}
const FT & y() const
{
return base.y();
}
const FT & z() const
{
return base.z();
}
const FT & hx() const
{
return base.hx();
}
const FT & hy() const
{
return base.hy();
}
const FT & hz() const
{
return base.hz();
}
const FT & hw() const
{
return base.hw();
}
const FT & cartesian(int i) const;
const FT & operator[](int i) const;
const FT & homogeneous(int i) const;
Cartesian_const_iterator cartesian_begin() const
{
return base.cartesian_begin();
}
Cartesian_const_iterator cartesian_end() const
{
return base.cartesian_end();
}
typename R_::Boolean operator==(const PointC3 &p) const
{
return base == p.base;
}
typename R_::Boolean operator!=(const PointC3 &p) const
{
return !(*this == p);
}
int dimension() const
{
return base.dimension();
}
Point_3 transform(const Aff_transformation_3 &t) const
{
return t.transform(*this);
}
};
template < class R >
inline
const typename PointC3<R>::FT &
PointC3<R>::cartesian(int i) const
{
return base.cartesian(i);
}
template < class R >
inline
const typename PointC3<R>::FT &
PointC3<R>::operator[](int i) const
{
return base[i];
}
template < class R >
inline
const typename PointC3<R>::FT &
PointC3<R>::homogeneous(int i) const
{
return base.homogeneous(i);
}
} //namespace CGAL
#endif // CGAL_CARTESIAN_POINT_3_H
|
