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
|
/**********************************************************************
* $Id: MaximalEdgeRing.cpp,v 1.11 2004/07/02 13:28:29 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 Public Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************
* $Log: MaximalEdgeRing.cpp,v $
* Revision 1.11 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.10 2004/06/30 20:59:13 strk
* Removed GeoemtryFactory copy from geometry constructors.
* Enforced const-correctness on GeometryFactory arguments.
*
* Revision 1.9 2003/11/07 01:23:42 pramsey
* Add standard CVS headers licence notices and copyrights to all cpp and h
* files.
*
* Revision 1.8 2003/10/13 17:47:49 strk
* delete statement removed
*
**********************************************************************/
#include <geos/opOverlay.h>
#include <stdio.h>
namespace geos {
MaximalEdgeRing::MaximalEdgeRing(DirectedEdge *start,const GeometryFactory *geometryFactory, CGAlgorithms *cga):
EdgeRing(start,geometryFactory,cga){
computePoints(start);
computeRing();
}
MaximalEdgeRing::~MaximalEdgeRing(){
}
DirectedEdge* MaximalEdgeRing::getNext(DirectedEdge *de) {
return de->getNext();
}
void MaximalEdgeRing::setEdgeRing(DirectedEdge *de,EdgeRing *er) {
de->setEdgeRing(er);
}
/**
* For all nodes in this EdgeRing,
* link the DirectedEdges at the node to form minimalEdgeRings
*/
void MaximalEdgeRing::linkDirectedEdgesForMinimalEdgeRings() {
DirectedEdge* de=startDe;
do {
Node* node=de->getNode();
((DirectedEdgeStar*) node->getEdges())->linkMinimalDirectedEdges(this);
de=de->getNext();
} while (de!=startDe);
}
// This function returns a newly allocated vector of
// pointers to newly allocated MinimalEdgeRing objects.
//
vector<MinimalEdgeRing*>* MaximalEdgeRing::buildMinimalRings() {
vector<MinimalEdgeRing*> *minEdgeRings=new vector<MinimalEdgeRing*>;
DirectedEdge *de=startDe;
do {
if(de->getMinEdgeRing()==NULL) {
MinimalEdgeRing *minEr=new MinimalEdgeRing(de,geometryFactory,cga);
minEdgeRings->push_back(minEr);
}
de=de->getNext();
} while(de!=startDe);
return minEdgeRings;
}
}
|
