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
|
/**********************************************************************
* $Id: InteriorPointLine.cpp,v 1.10 2004/07/08 19:34:49 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: InteriorPointLine.cpp,v $
* Revision 1.10 2004/07/08 19:34:49 strk
* Mirrored JTS interface of CoordinateSequence, factory and
* default implementations.
* Added DefaultCoordinateSequenceFactory::instance() function.
*
* Revision 1.9 2004/07/02 13:28:26 strk
* Fixed all #include lines to reflect headers layout change.
* Added client application build tips in README.
*
* Revision 1.8 2003/11/07 01:23:42 pramsey
* Add standard CVS headers licence notices and copyrights to all cpp and h
* files.
*
* Revision 1.7 2003/10/16 08:50:00 strk
* Memory leak fixes. Improved performance by mean of more calls to
* new getCoordinatesRO() when applicable.
*
**********************************************************************/
#include <geos/geosAlgorithm.h>
#include <geos/platform.h>
#include <typeinfo>
namespace geos {
InteriorPointLine::InteriorPointLine(Geometry *g) {
interiorPoint=NULL;
minDistance=DoubleInfinity;
Point *p=g->getCentroid();
centroid=p->getCoordinate();
addInterior(g);
if (interiorPoint==NULL)
addEndpoints(g);
delete p;
}
InteriorPointLine::~InteriorPointLine() {
}
/**
* Tests the interior vertices (if any)
* defined by a linear Geometry for the best inside point.
* If a Geometry is not of dimension 1 it is not tested.
* @param geom the geometry to add
*/
void InteriorPointLine::addInterior(const Geometry *geom){
if (typeid(*geom)==typeid(LineString)) {
addInterior(((LineString *)geom)->getCoordinatesRO());
} else if ((typeid(*geom)==typeid(GeometryCollection)) ||
(typeid(*geom)==typeid(MultiPoint)) ||
(typeid(*geom)==typeid(MultiPolygon)) ||
(typeid(*geom)==typeid(MultiLineString))) {
GeometryCollection *gc=(GeometryCollection*) geom;
for(int i=0;i<gc->getNumGeometries();i++) {
addInterior(gc->getGeometryN(i));
}
}
}
void InteriorPointLine::addInterior(const CoordinateSequence *pts) {
for(int i=1;i<pts->getSize()-1;i++) {
add(&(pts->getAt(i)));
}
}
/**
* Tests the endpoint vertices
* defined by a linear Geometry for the best inside point.
* If a Geometry is not of dimension 1 it is not tested.
* @param geom the geometry to add
*/
void InteriorPointLine::addEndpoints(const Geometry *geom) {
if (typeid(*geom)==typeid(LineString)) {
addEndpoints(((LineString*)geom)->getCoordinatesRO());
} else if ((typeid(*geom)==typeid(GeometryCollection)) ||
(typeid(*geom)==typeid(MultiPoint)) ||
(typeid(*geom)==typeid(MultiPolygon)) ||
(typeid(*geom)==typeid(MultiLineString))) {
GeometryCollection *gc=(GeometryCollection*) geom;
for(int i=0;i<gc->getNumGeometries();i++) {
addEndpoints(gc->getGeometryN(i));
}
}
}
void InteriorPointLine::addEndpoints(const CoordinateSequence *pts){
add(&(pts->getAt(0)));
add(&(pts->getAt(pts->getSize()-1)));
}
void InteriorPointLine::add(const Coordinate *point) {
double dist=point->distance(*centroid);
if (dist<minDistance) {
delete interiorPoint;
interiorPoint=new Coordinate(*point);
minDistance=dist;
}
}
Coordinate* InteriorPointLine::getInteriorPoint() const {
return interiorPoint;
}
}
|
