drawdelaunay.cpp
2.32 KB
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
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright 2012 The MITRE Corporation *
* *
* Licensed under the Apache License, Version 2.0 (the "License"); *
* you may not use this file except in compliance with the License. *
* You may obtain a copy of the License at *
* *
* http://www.apache.org/licenses/LICENSE-2.0 *
* *
* Unless required by applicable law or agreed to in writing, software *
* distributed under the License is distributed on an "AS IS" BASIS, *
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *
* See the License for the specific language governing permissions and *
* limitations under the License. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
#include <openbr/plugins/openbr_internal.h>
#include <openbr/core/opencvutils.h>
#include <opencv2/imgproc.hpp>
using namespace cv;
namespace br
{
/*!
* \ingroup transforms
* \brief Creates a Delaunay triangulation based on a set of points
* \author Scott Klum \cite sklum
*/
class DrawDelaunayTransform : public UntrainableTransform
{
Q_OBJECT
void project(const Template &src, Template &dst) const
{
dst = src;
if (src.file.contains("DelaunayTriangles")) {
QList<Point2f> validTriangles = OpenCVUtils::toPoints(src.file.getList<QPointF>("DelaunayTriangles"));
// Clone the matrix do draw on it
for (int i = 0; i < validTriangles.size(); i+=3) {
line(dst.m(), validTriangles[i], validTriangles[i+1], Scalar(0,0,0), 1);
line(dst.m(), validTriangles[i+1], validTriangles[i+2], Scalar(0,0,0), 1);
line(dst.m(), validTriangles[i+2], validTriangles[i], Scalar(0,0,0), 1);
}
} else qWarning("Template does not contain Delaunay triangulation.");
}
};
BR_REGISTER(Transform, DrawDelaunayTransform)
} // namespace br
#include "gui/drawdelaunay.moc"