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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libavoid - Fast, Incremental, Object-avoiding Line Router
* Copyright (C) 2004-2005 Michael Wybrow <mjwybrow@users.sourceforge.net>
*
* 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.
*
* 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. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "libavoid/connector.h"
#include "libavoid/graph.h"
#include "libavoid/visibility.h"
namespace Avoid {
void addShape(ShapeRef *shape)
{
uint pid = shape->id();
Polygn poly = shape->poly();
adjustContainsWithAdd(poly, pid);
// o Check all visibility edges to see if this one shape
// blocks them.
newBlockingShape(&poly, pid);
// o Calculate visibility for the new vertices.
if (UseLeesAlgorithm)
{
shapeVisSweep(shape);
}
else
{
shapeVis(shape);
}
callbackAllInvalidConnectors();
}
void delShape(ShapeRef *shape)
{
uint pid = shape->id();
// o Remove entries related to this shape's vertices
shape->removeFromGraph();
if (SelectiveReroute)
{
markConnectors(shape);
}
adjustContainsWithDel(pid);
delete shape;
// o Check all edges that were blocked by this shape.
if (InvisibilityGrph)
{
checkAllBlockedEdges(pid);
}
else
{
// check all edges not in graph
checkAllMissingEdges();
}
callbackAllInvalidConnectors();
}
ShapeRef *moveShape(ShapeRef *oldShape, Polygn *newPoly)
{
uint pid = oldShape->id();
// o Remove entries related to this shape's vertices
oldShape->removeFromGraph();
if (SelectiveReroute && !(PartialFeedback && PartialTime))
{
markConnectors(oldShape);
}
adjustContainsWithDel(pid);
delete oldShape;
oldShape = NULL;
adjustContainsWithAdd(*newPoly, pid);
// o Check all edges that were blocked by this shape.
if (InvisibilityGrph)
{
checkAllBlockedEdges(pid);
}
else
{
// check all edges not in graph
checkAllMissingEdges();
}
ShapeRef *newShape = new ShapeRef(pid, *newPoly);
// o Check all visibility edges to see if this one shape
// blocks them.
if (!(PartialFeedback && PartialTime))
{
newBlockingShape(newPoly, pid);
}
// o Calculate visibility for the new vertices.
if (UseLeesAlgorithm)
{
shapeVisSweep(newShape);
}
else
{
shapeVis(newShape);
}
callbackAllInvalidConnectors();
return newShape;
}
}
|
