blob: e85277e93a54d2c725baed951de882c09ba246b7 (
plain)
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
157
|
/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
* See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
* Author(s): David Salinas
*
* Copyright (C) 2014 Inria
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#ifndef POINT_H_
#define POINT_H_
#include <cmath>
#include <vector>
#include <cassert>
#include <cstddef>
#include <initializer_list>
class Point_d {
public:
Point_d(size_t dim = 3) : coords_(dim, 0) { }
Point_d(const Point_d& other) : coords_(other.coords_) { }
Point_d(const std::initializer_list<double>& list) : coords_(list) { }
template<typename CoordsIt>
Point_d(CoordsIt begin, CoordsIt end) : coords_(begin, end) { }
size_t dimension() const {
return coords_.size();
}
double x() const {
return coords_[0];
}
double y() const {
return coords_[1];
}
double z() const {
return coords_[2];
}
double& x() {
return coords_[0];
}
double& y() {
return coords_[1];
}
double& z() {
return coords_[2];
}
std::vector<double>::const_iterator begin() const {
return coords_.begin();
}
std::vector<double>::const_iterator end() const {
return coords_.end();
}
double& operator[](unsigned i) {
return coords_[i];
}
const double& operator[](unsigned i) const {
return coords_[i];
}
double squared_norm() const {
double res = 0;
for (auto x : coords_)
res += x * x;
return res;
}
friend double squared_dist(const Point_d& p1, const Point_d& p2) {
assert(p1.dimension() == p2.dimension());
double res = 0;
for (unsigned i = 0; i < p1.coords_.size(); ++i)
res += (p1[i] - p2[i])*(p1[i] - p2[i]);
return res;
}
/**
* dot product
*/
double operator*(const Point_d& other) const {
assert(dimension() == other.dimension());
double res = 0;
for (unsigned i = 0; i < coords_.size(); ++i)
res += coords_[i] * other[i];
return res;
}
/**
* only if points have dimension 3
*/
Point_d cross_product(const Point_d& other) {
assert(dimension() == 3 && other.dimension() == 3);
Point_d res(3);
res[0] = (*this)[1] * other[2] - (*this)[2] * other[1];
res[1] = (*this)[2] * other[0] - (*this)[0] * other[2];
res[2] = (*this)[0] * other[1] - (*this)[1] * other[0];
return res;
}
Point_d operator+(const Point_d& other) const {
assert(dimension() == other.dimension());
Point_d res(dimension());
for (unsigned i = 0; i < coords_.size(); ++i)
res[i] = (*this)[i] + other[i];
return res;
}
Point_d operator*(double lambda) const {
Point_d res(dimension());
for (unsigned i = 0; i < coords_.size(); ++i)
res[i] = (*this)[i] * lambda;
return res;
}
Point_d operator/(double lambda) const {
Point_d res(dimension());
for (unsigned i = 0; i < coords_.size(); ++i)
res[i] = (*this)[i] / lambda;
return res;
}
Point_d operator-(const Point_d& other) const {
assert(dimension() == other.dimension());
Point_d res(dimension());
for (unsigned i = 0; i < coords_.size(); ++i)
res[i] = (*this)[i] - other[i];
return res;
}
friend Point_d unit_normal(const Point_d& p1, const Point_d& p2, const Point_d& p3) {
assert(p1.dimension() == 3);
assert(p2.dimension() == 3);
assert(p3.dimension() == 3);
Point_d p1p2 = p2 - p1;
Point_d p1p3 = p3 - p1;
Point_d res(p1p2.cross_product(p1p3));
return res / std::sqrt(res.squared_norm());
}
private:
std::vector<double> coords_;
};
#endif // POINT_H_
|
