BubbleTree Class Reference
[Layout]
#include <BubbleTree.h>
List of all members.
Detailed Description
BubbleTree.h - An implementation of the bubble tree algorithm.
This plug-in implement the bubble tree drawing algorithm first published as:
Bubble Tree Drawing Algorithm :
S. Grivet and D. Auber and J-P Domenger and Guy Melançon,
International conference in computer vision and graphics,
september 2004.
Bubble Tree Drawing Algorithm :
D. Auber and S. Grivet and J-P Domenger and Guy Melançon,
Technical report : RR-1323-04, LaBRI university Bordeaux I.
HISTORY
- 07/12/04 Version 0.0.3: Use new Tulip plugin parameter mechanism
- 16/07/03 Version 0.0.2: Better management of node size
- 16/05/03 Version 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) or O(nlog(n)), By default O(nlog(n)) algorithm is used, but one can choose the complexity by using the argument (bool)"complexity" (true means O(nlog(n), false O(n)). The algorithm can manage nodes of different size. The SizeProperty "viewSize" is used by default if no parameters are given to the plug-in. The parameter is (SizeProperty*)"nodeSize".
- Author:
- David Auber, S. Grivet University Bordeaux I France: auber@tulip-software.org, grivet@labri.fr
Public Member Functions
Constructor & Destructor Documentation
BubbleTree::BubbleTree |
( |
const tlp::PropertyContext & |
|
) |
|
|
BubbleTree::~BubbleTree |
( |
|
) |
|
|
Member Function Documentation
bool BubbleTree::check |
( |
std::string & |
|
) |
|
|
void BubbleTree::reset |
( |
|
) |
|
|
|