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
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libcola - A library providing force-directed network layout using the
* stress-majorization method subject to separation constraints.
*
* Copyright (C) 2010-2014 Monash University
*
* This library 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 2.1 of the License, or (at your option) any later version.
* See the file LICENSE.LGPL distributed with the library.
*
* This library 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.
*
* Author(s): Michael Wybrow
*
*/
#ifndef COLA_CC_NONOVERLAPCONSTRAINTS_H
#define COLA_CC_NONOVERLAPCONSTRAINTS_H
#include <vector>
#include "libcola/compound_constraints.h"
#include "libcola/shapepair.h"
namespace vpsc {
class Rectangle;
}
namespace cola {
class OverlapShapeOffsets;
class ShapePairInfo;
class Cluster;
// Stores IDs of all rectangles exempt from non-overlap constraints.
class NonOverlapConstraintExemptions {
public:
NonOverlapConstraintExemptions();
void addExemptGroupOfNodes(ListOfNodeIndexes listOfNodeGroups);
bool shapePairIsExempt(ShapePair shapePair) const;
private:
std::set<ShapePair> m_exempt_pairs;
};
// Non-overlap constraints prevent a set of given shapes from overlapping.
class NonOverlapConstraints : public CompoundConstraint {
public:
NonOverlapConstraints(NonOverlapConstraintExemptions *exemptions,
unsigned int priority = PRIORITY_NONOVERLAP);
// Group is used to determine which objects should be made not to
// overlap with this one -- only objects in the same group.
// This is useful for clusters.
void addShape(unsigned id, double halfW, double halfH,
unsigned int group = 1);
void addCluster(Cluster *cluster, unsigned int group);
void computeAndSortOverlap(vpsc::Variables vs[]);
void markCurrSubConstraintAsActive(const bool satisfiable);
void markAllSubConstraintsAsInactive(void);
bool subConstraintsRemaining(void) const;
SubConstraintAlternatives getCurrSubConstraintAlternatives(
vpsc::Variables vs[]);
std::string toString(void) const;
void setClusterClusterExemptions(std::set<ShapePair> exemptions);
void generateVariables(const vpsc::Dim dim, vpsc::Variables& vars);
void generateSeparationConstraints(const vpsc::Dim dim,
vpsc::Variables& vars, vpsc::Constraints& gcs);
void generateSeparationConstraints(const vpsc::Dim dim,
vpsc::Variables& vars, vpsc::Constraints& gcs,
std::vector<vpsc::Rectangle*>& boundingBoxes);
private:
void computeOverlapForShapePairInfo(ShapePairInfo& info,
vpsc::Variables vs[]);
std::list<ShapePairInfo> pairInfoList;
std::map<unsigned, OverlapShapeOffsets> shapeOffsets;
bool pairInfoListSorted;
bool initialSortCompleted;
// Cluster variables
size_t clusterVarStartIndex;
size_t currClusterIndex;
size_t clusterMode;
NonOverlapConstraintExemptions *m_exemptions;
std::set<ShapePair> m_cluster_cluster_exemptions;
};
} // namespace cola
#endif // COLA_CC_NONOVERLAPCONSTRAINTS
|
