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
|
/**********************************************************************
* $Id: PointBuilder.cpp,v 1.13 2004/11/17 15:09:08 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.
*
**********************************************************************/
#include <geos/opOverlay.h>
#include <geos/io.h>
#include <stdio.h>
#ifndef DEBUG
#define DEBUG 0
#endif
#ifndef COMPUTE_Z
#define COMPUTE_Z 0
#endif
namespace geos {
PointBuilder::PointBuilder(OverlayOp *newOp, const GeometryFactory *newGeometryFactory,PointLocator *newPtLocator)
{
op=newOp;
geometryFactory=newGeometryFactory;
ptLocator=newPtLocator;
}
/*
* @return a list of the Points in the result of the specified
* overlay operation
*/
vector<Point*>*
PointBuilder::build(int opCode)
{
vector<Node*>* nodeList=collectNodes(opCode);
vector<Point*>* resultPointList=simplifyPoints(nodeList);
delete nodeList;
return resultPointList;
}
vector<Node*>*
PointBuilder::collectNodes(int opCode)
{
vector<Node*>* resultNodeList=new vector<Node*>();
// add nodes from edge intersections which have not already been
// included in the result
map<Coordinate,Node*,CoordLT> *nodeMap=op->getGraph()->getNodeMap()->nodeMap;
map<Coordinate,Node*,CoordLT>::iterator it=nodeMap->begin();
for (;it!=nodeMap->end();it++) {
Node *node=it->second;
if (!node->isInResult()) {
Label *label=node->getLabel();
if (OverlayOp::isResultOfOp(label,opCode)) {
resultNodeList->push_back(node);
}
}
}
return resultNodeList;
}
/*
* This method simplifies the resultant Geometry by finding and eliminating
* "covered" points.
* A point is covered if it is contained in another element Geometry
* with higher dimension (e.g. a point might be contained in a polygon,
* in which case the point can be eliminated from the resultant).
*/
vector<Point*>*
PointBuilder::simplifyPoints(vector<Node*> *resultNodeList)
{
vector<Point*>* nonCoveredPointList=new vector<Point*>();
for(int i=0;i<(int)resultNodeList->size();i++)
{
Node *n=(*resultNodeList)[i];
const Coordinate& coord=n->getCoordinate();
if(!op->isCoveredByLA(coord)) {
Point *pt=geometryFactory->createPoint(coord);
nonCoveredPointList->push_back(pt);
}
}
return nonCoveredPointList;
}
} // namespace geos
/**********************************************************************
* $Log: PointBuilder.cpp,v $
* Revision 1.13 2004/11/17 15:09:08 strk
* Changed COMPUTE_Z defaults to be more conservative
*
* Revision 1.12 2004/11/17 08:13:16 strk
* Indentation changes.
* Some Z_COMPUTATION activated by default.
*
* Revision 1.11 2004/10/21 22:29:54 strk
* Indentation changes and some more COMPUTE_Z rules
*
* Revision 1.10 2004/10/20 17:32:14 strk
* Initial approach to 2.5d intersection()
*
* Revision 1.9 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.8 2004/06/30 20:59:13 strk
* Removed GeoemtryFactory copy from geometry constructors.
* Enforced const-correctness on GeometryFactory arguments.
*
* Revision 1.7 2003/11/07 01:23:42 pramsey
* Add standard CVS headers licence notices and copyrights to all cpp and h
* files.
*
*
**********************************************************************/
|
