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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* 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 <time.h>
#include <math.h>
#include <climits>
#include <tulip/TulipPlugin.h>
using namespace std;
using namespace tlp;
using namespace stdext;
namespace {
const char * paramHelp[] = {
// nodes
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "unsigned int" ) \
HTML_HELP_DEF( "default", "30" ) \
HTML_HELP_BODY() \
"This parameter defines the number of nodes used to build the planar graph." \
HTML_HELP_CLOSE(),
};
}
namespace {
struct Triangle {
Triangle(node a, node b, node c):
a(a),b(b),c(c) {
}
node a,b,c;
};
}
//=============================================================
/** \addtogroup import */
/*@{*/
/// Planar Graph - Import of planer graph
/** This plugin enables to create a planar graph
*
* User can specify the number of nodes.
*/
class PlanarGraph:public ImportModule {
public:
PlanarGraph(AlgorithmContext context):ImportModule(context) {
addParameter<unsigned int>("nodes", paramHelp[0], "30");
}
~PlanarGraph() {}
bool importGraph() {
unsigned int nbNodes = 30;
if (dataSet!=0) {
dataSet->get("nodes", nbNodes);
}
if (nbNodes < 3) nbNodes = 3;
srand(clock());
LayoutProperty *newLayout = graph->getLocalProperty<LayoutProperty>("viewLayout");
SizeProperty *newSize = graph->getLocalProperty<SizeProperty>("viewSize");
newSize->setAllNodeValue(Size(1.0,1.0,1.0));
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 = static_cast<float>(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 = rand()%faces.size();
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;
}
};
/*@}*/
IMPORTPLUGINOFGROUP(PlanarGraph,"Planar Graph","Auber","25/06/2005","","1.0","Graphs")
|
