SYNOPSIS

#include <MixedModel.h>

Public Member Functions

MixedModel (const tlp::PropertyContext &context)

~MixedModel ()

bool run ()

bool check (std::string &)

Detailed Description

MixedModel.h- An implementation of a polyline graph drawing.

This plugin is an implementation of the planar polyline drawing algorithm, the mixed model algorithm, first published as:

C. Gutwenger and P. Mutzel,

 'Planar Polyline Drawings with Good Angular Resolution', 

 'Lecture Notes In Computer Science, Vol. 1547' 

 'Proceedings of the 6th International Symposium on Graph Drawing,' 

 pages '167--182' 

 1998 

HISTORY

• 19/06/2005 Verson 0.0.1: first version by S. BARDET and A. BURNETT
• 06/11/2006 Version 0.0.2: new version with improvements

Let n be the number of nodes, the original algorithm complexity is in O(n).

 But the implementation of the canonical ordering has not been made in O(n).

 This version of the algorithm considers each connected component of the graph, tests if it is planar or not. If not, it computes a planar subgraphs, which is a maximal planar 'sub-map'. Then an area aware version of Gutwenger and Mutzel 's algorithm is used, and if the connected component was not planar, it adds the 'unplanar' edges in 3D. Finally, it uses the Connected Component Packing plugin of Tulip Software to pack the connected components.

Author:

S. Bardet, Romain Bourqui LaBRI, University Bordeaux I France, Email : [email protected]

LICENCE

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.

Constructor & Destructor Documentation

MixedModel::MixedModel (const tlp::PropertyContext & context)

MixedModel::~MixedModel ()

Member Function Documentation

bool MixedModel::check (std::string &)

bool MixedModel::run ()

Author

Generated automatically by Doxygen for Tulip Plugins Library from the source code.