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
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libavoid - Fast, Incremental, Object-avoiding Line Router
* Copyright (C) 2004-2006 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 <cassert>
#include <iostream>
#include "libavoid/vertices.h"
#include "libavoid/connector.h"
#include "libavoid/graph.h"
#include "libavoid/static.h"
#include "libavoid/shape.h"
#include "libavoid/visibility.h"
#include "libavoid/debug.h"
#include "libavoid/router.h"
namespace Avoid {
static void computeCompleteVis(Router *router);
// This should only be used for the static algorithm.
//
// XXX: If to set up the vis graph for incremental it would need
// the shapeRef ppinters in obs.
//
void CreateVisGraph(Router *router, Polygn **obs, int n_obs)
{
for (int poly_i = 0; poly_i < n_obs; poly_i++)
{
unsigned int id = obs[poly_i]->id;
new ShapeRef(router, id, *(obs[poly_i]));
}
computeCompleteVis(router);
}
static void computeCompleteVis(Router *router)
{
VertInf *beginVert = router->vertices.shapesBegin();
VertInf *endVert = router->vertices.end();
for (VertInf *i = beginVert; i != endVert; i = i->lstNext)
{
db_printf("-- CONSIDERING --\n");
i->id.db_print();
for (VertInf *j = i->lstPrev ; j != NULL; j = j->lstPrev)
{
bool knownNew = true;
EdgeInf::checkEdgeVisibility(i, j, knownNew);
}
}
}
void DestroyVisGraph(Router *router)
{
ShapeRefList::iterator sFinish = router->shapeRefs.end();
ShapeRefList::iterator sCurr;
while ((sCurr = router->shapeRefs.begin()) != sFinish)
{
ShapeRef *shape = (*sCurr);
shape->removeFromGraph();
delete shape;
}
ConnRefList::iterator cFinish = router->connRefs.end();
ConnRefList::iterator cCurr;
while ((cCurr = router->connRefs.begin())!= cFinish)
{
ConnRef *conn = (*cCurr);
conn->removeFromGraph();
conn->unInitialise();
}
assert(router->vertices.connsBegin() == NULL);
}
}
|
