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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
|
/**********************************************************************
* $Id: PointLocator.cpp 1986 2007-06-08 15:27:42Z mloskot $
*
* GEOS - Geometry Engine Open Source
* http://geos.refractions.net
*
* Copyright (C) 2005-2006 Refractions Research Inc.
* 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.
*
**********************************************************************
*
* Last port: algorithm/PointLocator.java rev. 1.26 (JTS-1.7+)
*
**********************************************************************/
#include <geos/algorithm/PointLocator.h>
#include <geos/algorithm/CGAlgorithms.h>
#include <geos/geom/Geometry.h>
#include <geos/geom/LineString.h>
#include <geos/geom/LinearRing.h>
#include <geos/geom/MultiLineString.h>
#include <geos/geom/Polygon.h>
#include <geos/geom/MultiPolygon.h>
#include <geos/geom/Location.h>
#include <geos/geomgraph/GeometryGraph.h>
#include <cassert>
#include <typeinfo>
using namespace geos::geom;
namespace geos {
namespace algorithm { // geos.algorithm
int
PointLocator::locate(const Coordinate& p, const Geometry *geom)
{
if (geom->isEmpty()) return Location::EXTERIOR;
const LineString *ls_geom = dynamic_cast<const LineString *>(geom);
if (ls_geom) return locate(p, ls_geom);
const Polygon *poly_geom = dynamic_cast<const Polygon *>(geom);
if (poly_geom) return locate(p, poly_geom);
isIn=false;
numBoundaries=0;
computeLocation(p,geom);
if (geomgraph::GeometryGraph::isInBoundary(numBoundaries)) return Location::BOUNDARY;
if (numBoundaries>0 || isIn) return Location::INTERIOR;
return Location::EXTERIOR;
}
/* private */
void
PointLocator::computeLocation(const Coordinate& p, const Geometry *geom)
{
if (const LineString *ls=dynamic_cast<const LineString*>(geom))
{
updateLocationInfo(locate(p, ls));
}
else if (const Polygon *po=dynamic_cast<const Polygon*>(geom))
{
updateLocationInfo(locate(p, po));
}
else if (const MultiLineString *mls=dynamic_cast<const MultiLineString *>(geom))
{
for(std::size_t i=0, n=mls->getNumGeometries(); i<n; ++i)
{
const LineString *l=dynamic_cast<const LineString *>(mls->getGeometryN(i));
updateLocationInfo(locate(p,l));
}
}
else if (const MultiPolygon *mpo=dynamic_cast<const MultiPolygon *>(geom))
{
for(std::size_t i=0, n=mpo->getNumGeometries(); i<n; ++i)
{
const Polygon *po=dynamic_cast<const Polygon *>(mpo->getGeometryN(i));
updateLocationInfo(locate(p, po));
}
}
else if (const GeometryCollection *col=dynamic_cast<const GeometryCollection *>(geom))
{
for (GeometryCollection::const_iterator
it=col->begin(), endIt=col->end();
it != endIt;
++it)
{
const Geometry *g2=*it;
assert (g2!=geom); // is this check really needed ?
computeLocation(p, g2);
}
}
}
/* private */
void
PointLocator::updateLocationInfo(int loc)
{
if (loc==Location::INTERIOR) isIn=true;
if (loc==Location::BOUNDARY) ++numBoundaries;
}
/* private */
int
PointLocator::locate(const Coordinate& p, const LineString *l)
{
const CoordinateSequence* pt=l->getCoordinatesRO();
if (! l->isClosed()) {
if ((p==pt->getAt(0)) || (p==pt->getAt(pt->getSize()-1))) {
return Location::BOUNDARY;
}
}
if (CGAlgorithms::isOnLine(p,pt))
return Location::INTERIOR;
return Location::EXTERIOR;
}
/* private */
int
PointLocator::locateInPolygonRing(const Coordinate& p, const LinearRing *ring)
{
// can this test be folded into isPointInRing ?
const CoordinateSequence *cl = ring->getCoordinatesRO();
if (CGAlgorithms::isOnLine(p,cl))
return Location::BOUNDARY;
if (CGAlgorithms::isPointInRing(p,cl))
return Location::INTERIOR;
return Location::EXTERIOR;
}
/* private */
int
PointLocator::locate(const Coordinate& p,const Polygon *poly)
{
if (poly->isEmpty()) return Location::EXTERIOR;
const LinearRing *shell=dynamic_cast<const LinearRing *>(poly->getExteriorRing());
assert(shell);
int shellLoc=locateInPolygonRing(p, shell);
if (shellLoc==Location::EXTERIOR) return Location::EXTERIOR;
if (shellLoc==Location::BOUNDARY) return Location::BOUNDARY;
// now test if the point lies in or on the holes
for(size_t i=0, n=poly->getNumInteriorRing(); i<n; ++i)
{
const LinearRing *hole=dynamic_cast<const LinearRing *>(poly->getInteriorRingN(i));
int holeLoc=locateInPolygonRing(p,hole);
if (holeLoc==Location::INTERIOR) return Location::EXTERIOR;
if (holeLoc==Location::BOUNDARY) return Location::BOUNDARY;
}
return Location::INTERIOR;
}
} // namespace geos.algorithm
} // namespace geos
/**********************************************************************
* $Log$
* Revision 1.31 2006/06/12 10:49:43 strk
* unsigned int => size_t
*
* Revision 1.30 2006/04/07 09:54:29 strk
* Geometry::getNumGeometries() changed to return 'unsigned int'
* rather then 'int'
*
* Revision 1.29 2006/03/21 11:12:23 strk
* Cleanups: headers inclusion and Log section
*
* Revision 1.28 2006/03/09 16:46:46 strk
* geos::geom namespace definition, first pass at headers split
**********************************************************************/
|
