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
|
/**********************************************************************
* $Id: InteriorPointArea.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.
*
**********************************************************************/
#include <geos/algorithm/InteriorPointArea.h>
#include <geos/geom/Coordinate.h>
#include <geos/geom/Geometry.h>
#include <geos/geom/GeometryCollection.h>
#include <geos/geom/Polygon.h>
#include <geos/geom/LineString.h>
#include <geos/geom/Envelope.h>
#include <geos/geom/GeometryFactory.h>
#include <geos/geom/CoordinateSequenceFactory.h>
#include <vector>
#include <typeinfo>
using namespace std;
using namespace geos::geom;
namespace geos {
namespace algorithm { // geos.algorithm
// file-statics
namespace {
double avg(double a, double b){return (a+b)/2.0;}
}
/*public*/
InteriorPointArea::InteriorPointArea(const Geometry *g)
{
foundInterior=false;
maxWidth=0.0;
factory=g->getFactory();
add(g);
}
/*public*/
InteriorPointArea::~InteriorPointArea()
{
}
/*public*/
bool
InteriorPointArea::getInteriorPoint(Coordinate& ret) const
{
if ( ! foundInterior ) return false;
ret=interiorPoint;
return true;
}
/*public*/
void
InteriorPointArea::add(const Geometry *geom)
{
const Polygon *poly = dynamic_cast<const Polygon*>(geom);
if ( poly ) {
addPolygon(geom);
return;
}
const GeometryCollection *gc = dynamic_cast<const GeometryCollection*>(geom);
if ( gc )
{
for(std::size_t i=0, n=gc->getNumGeometries(); i<n; i++) {
add(gc->getGeometryN(i));
}
}
}
/*public*/
void
InteriorPointArea::addPolygon(const Geometry *geometry)
{
LineString *bisector=horizontalBisector(geometry);
Geometry *intersections=bisector->intersection(geometry);
const Geometry *widestIntersection=widestGeometry(intersections);
const Envelope *env=widestIntersection->getEnvelopeInternal();
double width=env->getWidth();
if (!foundInterior || width>maxWidth) {
env->centre(interiorPoint);
maxWidth = width;
foundInterior=true;
}
//delete env;
delete bisector;
delete intersections;
}
//@return if geometry is a collection, the widest sub-geometry; otherwise,
//the geometry itself
const Geometry*
InteriorPointArea::widestGeometry(const Geometry *geometry)
{
const GeometryCollection *gc = dynamic_cast<const GeometryCollection*>(geometry);
if ( gc ) {
return widestGeometry(gc);
} else {
return geometry;
}
}
const Geometry*
InteriorPointArea::widestGeometry(const GeometryCollection* gc) {
if (gc->isEmpty()) {
return gc;
}
const Geometry* widestGeometry=gc->getGeometryN(0);
//Start at 1
for(std::size_t i=1, n=gc->getNumGeometries(); i<n; i++)
{
const Envelope *env1(gc->getGeometryN(i)->getEnvelopeInternal());
const Envelope *env2(widestGeometry->getEnvelopeInternal());
if (env1->getWidth()>env2->getWidth()) {
widestGeometry=gc->getGeometryN(i);
}
}
return widestGeometry;
}
LineString*
InteriorPointArea::horizontalBisector(const Geometry *geometry)
{
const Envelope *envelope=geometry->getEnvelopeInternal();
// Assert: for areas, minx <> maxx
double avgY=avg(envelope->getMinY(),envelope->getMaxY());
vector<Coordinate>*cv=new vector<Coordinate>(2);
(*cv)[0].x = envelope->getMinX();
(*cv)[0].y = avgY;
(*cv)[1].x = envelope->getMaxX();
(*cv)[1].y = avgY;
//delete envelope;
CoordinateSequence *cl = factory->getCoordinateSequenceFactory()->create(cv);
LineString *ret = factory->createLineString(cl);
//delete cl;
return ret;
}
} // namespace geos.algorithm
} // namespace geos
/**********************************************************************
* $Log$
* Revision 1.22 2006/04/07 09:54:29 strk
* Geometry::getNumGeometries() changed to return 'unsigned int'
* rather then 'int'
*
* Revision 1.21 2006/03/21 11:12:23 strk
* Cleanups: headers inclusion and Log section
*
* Revision 1.20 2006/03/09 16:46:45 strk
* geos::geom namespace definition, first pass at headers split
**********************************************************************/
|
