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
|
/**********************************************************************
* $Id: SimplePointInAreaLocator.cpp 1820 2006-09-06 16:54:23Z 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.
*
**********************************************************************/
#include <geos/algorithm/CGAlgorithms.h>
#include <geos/algorithm/SimplePointInAreaLocator.h>
#include <geos/geom/Geometry.h>
#include <geos/geom/Polygon.h>
#include <geos/geom/GeometryCollection.h>
#include <geos/geom/Location.h>
#include <geos/geom/CoordinateSequence.h>
#include <geos/geom/LineString.h>
#include <typeinfo>
#include <cassert>
using namespace geos::geom;
namespace geos {
namespace algorithm { // geos.algorithm
/**
* locate is the main location function. It handles both single-element
* and multi-element Geometries. The algorithm for multi-element Geometries
* is more complex, since it has to take into account the boundaryDetermination rule
*/
int
SimplePointInAreaLocator::locate(const Coordinate& p, const Geometry *geom)
{
if (geom->isEmpty()) return Location::EXTERIOR;
if (containsPoint(p,geom))
return Location::INTERIOR;
return Location::EXTERIOR;
}
bool
SimplePointInAreaLocator::containsPoint(const Coordinate& p,const Geometry *geom)
{
if (const Polygon *poly = dynamic_cast<const Polygon*>(geom))
{
return containsPointInPolygon(p, poly);
}
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);
if (containsPoint(p,g2)) return true;
}
}
return false;
}
bool
SimplePointInAreaLocator::containsPointInPolygon(const Coordinate& p, const Polygon *poly)
{
if (poly->isEmpty()) return false;
const LineString *shell=poly->getExteriorRing();
const CoordinateSequence *cl;
cl = shell->getCoordinatesRO();
if (!CGAlgorithms::isPointInRing(p,cl)) {
return false;
}
// now test if the point lies in or on the holes
for(size_t i=0, n=poly->getNumInteriorRing(); i<n; i++)
{
const LineString *hole = poly->getInteriorRingN(i);
cl = hole->getCoordinatesRO();
if (CGAlgorithms::isPointInRing(p,cl)) {
return false;
}
}
return true;
}
} // namespace geos.algorithm
} // namespace geos
/**********************************************************************
* $Log$
* Revision 1.22 2006/06/12 11:29:23 strk
* unsigned int => size_t
*
* Revision 1.21 2006/03/21 11:12:23 strk
* Cleanups: headers inclusion and Log section
*
* Revision 1.20 2006/03/09 16:46:46 strk
* geos::geom namespace definition, first pass at headers split
*
**********************************************************************/
|
