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
|
//-*-c++-*-
#ifndef _RESOLVE_OVERLAP_H
#define _RESOLVE_OVERLAP_H
/** \addtogroup layout */
/*@{*/
/** \file
* \brief A layout algorithm to resolve all node overlaps.
*
* An implementation of a layout algorithm resolving the problem
* of node overlaps. It was first published as:
*
* Tim Dwyer, Kim Marriot, Peter J. Stuckey,
* "Fast Node Overlap Removal" in Graph Drawing, Vol. 3843 (2006), pp. 153-164.
*
* <b>NOTES</b>
*
* The algorithm works on general graphs. It finds and applies
* the minimum scale factor to ensure that no two pairs of nodes
* overlap in the graph.
* Let n be the number of nodes, the algorithm complexity is in O(n).
* If two nodes start out at the same postion the algorithm cannot
* succeed. It will return failure.
*
* <b>HISTORY</b>
*
* - 2006 Version 1.0: first version by Daniel Archambault,
* Department of Computer Science, University of British Columbia
*
* <b>LICENCE</b>
*
* 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.
*
*/
#include <tulip/TulipPluginHeaders.h>
#include <tulip/MutableContainer.h>
class FastOverlapRemoval:public tlp::LayoutAlgorithm {
public:
PLUGININFORMATION("Fast Overlap Removal" ,"Daniel Archambault", "08/12/2006", "Remove all nodes overlap.", "1.3", "Misc")
FastOverlapRemoval(const tlp::PluginContext *context);
inline ~FastOverlapRemoval() {}
bool run();
};
/*@}*/
#endif
|
