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
|
/**
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip 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 General Public License for more details.
*
*/
#include <climits>
#include <tulip/TulipPluginHeaders.h>
using namespace std;
using namespace tlp;
static const char *paramHelp[] = {
// nodes
"Number of nodes in the final graph."};
namespace {
struct Triangle {
Triangle(node a, node b, node c) : a(a), b(b), c(c) {}
node a, b, c;
};
} // namespace
//=============================================================
/** \addtogroup import */
/// Planar Graph - Import of a planar graph
/** This plugin enables to create a planar graph
*
* User can specify the number of nodes.
*/
class PlanarGraph : public ImportModule {
public:
PLUGININFORMATION("Planar Graph", "Auber", "25/06/2005",
"Imports a new randomly generated planar graph.", "1.0", "Graph")
PlanarGraph(tlp::PluginContext *context) : ImportModule(context) {
addInParameter<unsigned int>("nodes", paramHelp[0], "30");
}
~PlanarGraph() override {}
bool importGraph() override {
unsigned int nbNodes = 30;
if (dataSet != nullptr) {
dataSet->get("nodes", nbNodes);
}
if (nbNodes < 3)
nbNodes = 3;
// initialize a random sequence according the given seed
tlp::initRandomSequence();
LayoutProperty *newLayout = graph->getLocalProperty<LayoutProperty>("viewLayout");
SizeProperty *newSize = graph->getLocalProperty<SizeProperty>("viewSize");
newSize->setAllNodeValue(Size(1.0, 1.0, 1.0));
// reserve graph needed elts
graph->reserveNodes(nbNodes);
graph->reserveEdges(3 * (nbNodes - 2));
vector<Triangle> faces;
Triangle f(graph->addNode(), graph->addNode(), graph->addNode());
faces.push_back(f);
graph->addEdge(f.a, f.b);
graph->addEdge(f.b, f.c);
graph->addEdge(f.c, f.a);
float val = nbNodes;
newLayout->setNodeValue(f.a, Coord(-val, -val, 0));
newLayout->setNodeValue(f.b, Coord(0, val, 0));
newLayout->setNodeValue(f.c, Coord(val, -val, 0));
unsigned int nb = 3;
while (nb < nbNodes) {
// choose a Triangle randomly
unsigned int i = randomUnsignedInteger(faces.size() - 1);
Triangle f = faces[i];
node n = graph->addNode();
Coord &&tmp = newLayout->getNodeValue(f.a) + newLayout->getNodeValue(f.b) +
newLayout->getNodeValue(f.c);
tmp /= 3.0;
newLayout->setNodeValue(n, tmp);
// Split the triangle in three part
graph->addEdge(n, f.a);
graph->addEdge(n, f.b);
graph->addEdge(n, f.c);
// add the three new Triangle, remove the old one(replace)
Triangle f1(f.a, f.b, n);
Triangle f2(f.b, f.c, n);
Triangle f3(f.c, f.a, n);
faces[i] = f1;
faces.push_back(f2);
faces.push_back(f3);
++nb;
}
return pluginProgress->state() != TLP_CANCEL;
}
};
PLUGIN(PlanarGraph)
|
