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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* 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.
*
*/
#ifndef _TREE3DLAYOUT_H
#define _TREE3DLAYOUT_H
#include <tulip/tuliphash.h>
#include <tulip/TulipPluginHeaders.h>
/** \addtogroup layout */
/// ConeTreeExtended.h - An implementation of the cone tree layout.
/** This plugin is an extension of the Cone tree layout
* algorithm first published as:
*
* A. FJ. Carriere and R. Kazman, \n
* "Interacting with Huge Hierarchies: Beyond Cone Trees", \n
* In Proceedings of InfoViz'95, \n
* IEEE Symposium on Information Visualization \n
* pages 74-78, 1995,
*
* Information about the extension can be found in :
*
* D.Auber, PhD Thesis, "Outils de visualisation de larges structures de donnees",
* University Bordeaux, december 2002.
*
* <b> HISTORY</b>
*
* - 01/04/99 Verson 0.0.1: Initial release
*
* \note This algorithm only works on trees.
* Let n be the number of nodes, the algorithm complexity is in O(n).
*
* \author David Auber University Bordeaux I France: Email:auber@tulip-software.org
*/
class ConeTreeExtended:public tlp::LayoutAlgorithm {
public:
PLUGININFORMATION("Cone Tree","David Auber","01/04/2001",
"Implements an extension of the Cone tree layout algorithm first published as:<br/>"
"<b>Interacting with Huge Hierarchies: Beyond Cone Trees </b>, A. FJ. Carriere and R. Kazman, InfoViz'95, IEEE Symposium on Information Visualization pages 74--78 (1995).",
"1.0","Tree")
ConeTreeExtended(const tlp::PluginContext* context);
~ConeTreeExtended();
bool run();
private:
double treePlace3D(tlp::node n, TLP_HASH_MAP<tlp::node,double> *posRelX,
TLP_HASH_MAP<tlp::node,double> *posRelY);
void calcLayout(tlp::node n, TLP_HASH_MAP<tlp::node,double> *px,
TLP_HASH_MAP<tlp::node,double> *py,
double x, double y, int level);
void computeLayerSize(tlp::node n, unsigned int level);
void computeYCoodinates(tlp::node root);
tlp::Graph *tree;
tlp::SizeProperty * nodeSize;
std::vector<float> yCoordinates;
std::vector<float> levelSize;
float spaceBetweenLevels;
};
#endif
|
