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
|
/*
Copyright (c) 2015, M. Kerber, D. Morozov, A. Nigmetov
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
You are under no obligation whatsoever to provide any bug fixes, patches, or
upgrades to the features, functionality or performance of the source code
(Enhancements) to anyone; however, if you choose to make your Enhancements
available either publicly, or directly to copyright holder,
without imposing a separate written license agreement for such Enhancements,
then you hereby grant the following license: a non-exclusive, royalty-free
perpetual license to install, use, modify, prepare derivative works, incorporate
into other computer software, distribute, and sublicense such enhancements or
derivative works thereof, in binary and source code form.
*/
#ifndef BASIC_DEFS_WS_H
#define BASIC_DEFS_WS_H
#include <vector>
#include <cmath>
#include <cstddef>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <cassert>
#ifdef _WIN32
#include <ciso646>
#endif
#include "def_debug_ws.h"
#define MIN_VALID_ID 10
namespace geom_ws {
using IdxType = int;
using IdxValPair = std::pair<IdxType, double>;
struct Point {
double x, y;
bool operator==(const Point& other) const;
bool operator!=(const Point& other) const;
Point(double ax, double ay) : x(ax), y(ay) {}
Point() : x(0.0), y(0.0) {}
#ifndef FOR_R_TDA
friend std::ostream& operator<<(std::ostream& output, const Point p);
#endif
};
struct DiagramPoint
{
// data members
// Points above the diagonal have type NORMAL
// Projections onto the diagonal have type DIAG
// for DIAG points only x-coordinate is relevant
enum Type { NORMAL, DIAG};
double x, y;
Type type;
// methods
DiagramPoint(double xx, double yy, Type ttype);
bool isDiagonal(void) const { return type == DIAG; }
bool isNormal(void) const { return type == NORMAL; }
double getRealX() const; // return the x-coord
double getRealY() const; // return the y-coord
double persistenceLp(const double p) const;
#ifndef FOR_R_TDA
friend std::ostream& operator<<(std::ostream& output, const DiagramPoint p);
#endif
struct LexicographicCmp
{
bool operator()(const DiagramPoint& p1, const DiagramPoint& p2) const
{ return p1.type < p2.type || (p1.type == p2.type && (p1.x < p2.x || (p1.x == p2.x && p1.y < p2.y))); }
};
};
double sqrDist(const Point& a, const Point& b);
double dist(const Point& a, const Point& b);
double distLInf(const DiagramPoint& a, const DiagramPoint& b);
double distLp(const DiagramPoint& a, const DiagramPoint& b, const double p);
double persistenceLp(const DiagramPoint& a, const double p);
template<typename DiagPointContainer>
double getFurthestDistance3Approx(DiagPointContainer& A, DiagPointContainer& B)
{
double result { 0.0 };
DiagramPoint begA = *(A.begin());
DiagramPoint optB = *(B.begin());
for(const auto& pointB : B) {
if (distLInf(begA, pointB) > result) {
result = distLInf(begA, pointB);
optB = pointB;
}
}
for(const auto& pointA : A) {
if (distLInf(pointA, optB) > result) {
result = distLInf(pointA, optB);
}
}
return result;
}
} // end of namespace geom_ws
#endif
|
