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
|
/**********************************************************************
* $Id: planarNode.cpp,v 1.4 2004/10/19 19:51:14 strk Exp $
*
* GEOS - Geometry Engine Open Source
* http://geos.refractions.net
*
* Copyright (C) 2001-2002 Vivid Solutions Inc.
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU Lesser General Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************/
#include <geos/planargraph.h>
namespace geos {
//namespace planargraph {
/**
* Returns all Edges that connect the two nodes (which are assumed to be different).
*/
vector<planarEdge*>* planarNode::getEdgesBetween(planarNode *node0, planarNode *node1) {
// vector<planarEdge*> *edges0=planarDirectedEdge::toEdges(node0->getOutEdges()->getEdges());
//Set commonEdges = new HashSet(edges0);
//List edges1 = DirectedEdge.toEdges(node1.getOutEdges().getEdges());
//commonEdges.retainAll(edges1);
//return commonEdges;
return NULL;
}
/**
* Constructs a Node with the given location.
*/
planarNode::planarNode(const Coordinate& newPt)
{
#ifdef DEBUG_ALLOC
cerr<<"["<<this<<"] planarNode(const Coordinate&)"<<endl;
#endif
pt=newPt;
deStar=new planarDirectedEdgeStar();
}
/*
* Constructs a Node with the given location and collection of
* outgoing DirectedEdges.
*/
planarNode::planarNode(Coordinate& newPt, planarDirectedEdgeStar *newDeStar)
{
#ifdef DEBUG_ALLOC
cerr<<"["<<this<<"] planarNode(const Coordinate&, planarDirectedEdgeStar *)"<<endl;
#endif // DEBUG_ALLOC
pt=newPt;
deStar=newDeStar;
}
/**
* Returns the location of this Node.
*/
Coordinate& planarNode::getCoordinate() {
return pt;
}
/*
* Adds an outgoing DirectedEdge to this Node.
*/
void
planarNode::addOutEdge(planarDirectedEdge *de)
{
deStar->add(de);
}
/**
* Returns the collection of DirectedEdges that leave this Node.
*/
planarDirectedEdgeStar*
planarNode::getOutEdges()
{
return deStar;
}
/**
* Returns the number of edges around this Node.
*/
int planarNode::getDegree() {
return deStar->getDegree();
}
/**
* Returns the zero-based index of the given Edge, after sorting in ascending order
* by angle with the positive x-axis.
*/
int planarNode::getIndex(planarEdge *edge){
return deStar->getIndex(edge);
}
planarNode::~planarNode()
{
#ifdef DEBUG_ALLOC
cerr<<"["<<this<<"] ~planarNode()"<<endl;
#endif // DEBUG_ALLOC
delete deStar;
}
//} // namespace planargraph
} // namespace geos
/**********************************************************************
* $Log: planarNode.cpp,v $
* Revision 1.4 2004/10/19 19:51:14 strk
* Fixed many leaks and bugs in Polygonizer.
* Output still bogus.
*
* Revision 1.3 2004/10/13 10:03:02 strk
* Added missing linemerge and polygonize operation.
* Bug fixes and leaks removal from the newly added modules and
* planargraph (used by them).
* Some comments and indentation changes.
*
* Revision 1.2 2004/07/02 13:28:29 strk
* Fixed all #include lines to reflect headers layout change.
* Added client application build tips in README.
*
* Revision 1.1 2004/04/04 06:29:11 ybychkov
* "planargraph" and "geom/utill" upgraded to JTS 1.4
*
*
**********************************************************************/
|
