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
|
/*
* This file is part of gerbolyze, a vector image preprocessing toolchain
* Copyright (C) 2021 Jan Sebastian Götte <gerbolyze@jaseg.de>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#pragma once
#include <array>
#include <string>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <assert.h>
#include "geom2d.hpp"
using namespace std;
namespace gerbolyze {
namespace nopencv {
enum ContourPolarity {
CP_CONTOUR,
CP_HOLE
};
typedef std::function<void(Polygon_i&, ContourPolarity)> ContourCallback;
template<typename T> class Image {
public:
Image() {}
Image(int w, int h, const T *data=nullptr);
Image(const Image<T> &other) : Image<T>(other.cols(), other.rows(), other.ptr()) {}
template<typename U> Image(const Image<U> &other) : Image<T>(other.cols(), other.rows()) {
for (size_t y=0; y<m_rows; y++) {
for (size_t x=0; x<m_cols; x++) {
at(x, y) = other.at(x, y);
}
}
}
~Image() {
if (m_data) {
delete m_data;
}
}
bool load(const char *filename);
bool load_memory(const void *buf, size_t len);
void binarize(T threshold);
T &at(int x, int y) {
assert(x >= 0 && y >= 0 && x < m_cols && y < m_rows);
assert(m_data != nullptr);
return m_data[y*m_cols + x];
};
void set_at(int x, int y, T val) {
assert(x >= 0 && y >= 0 && x < m_cols && y < m_rows);
assert(m_data != nullptr);
m_data[y*m_cols + x] = val;
cerr << "set_at " << x << " " << y << ": " << val << " -> " << at(x, y) << endl;
};
const T &at(int x, int y) const {
assert(x >= 0 && y >= 0 && x < m_cols && y < m_rows);
assert(m_data != nullptr);
return m_data[y*m_cols + x];
};
T at_default(int x, int y, T default_value=0) const {
assert(m_data != nullptr);
if (x >= 0 && y >= 0 && x < m_cols && y < m_rows) {
return at(x, y);
} else {
return default_value;
}
};
void blur(int radius);
void resize(int new_w, int new_h);
int rows() const { return m_rows; }
int cols() const { return m_cols; }
int size() const { return m_cols*m_rows; }
const T *ptr() const { return m_data; }
private:
bool stb_to_internal(uint8_t *data);
T *m_data = nullptr;
int m_rows=0, m_cols=0;
};
typedef Image<uint8_t> Image8;
typedef Image<int32_t> Image32;
typedef Image<float> Image32f;
void find_contours(Image32 &img, ContourCallback cb);
ContourCallback simplify_contours_teh_chin(ContourCallback cb);
ContourCallback simplify_contours_douglas_peucker(ContourCallback cb);
double polygon_area(Polygon_i &poly);
double polygon_perimeter(Polygon_i &poly);
d2p polygon_centroid(Polygon_i &poly);
}
}
|
