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 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230
|
/**********************************************************************
* $Id: LineMerger.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/operation/linemerge/LineMerger.h>
#include <geos/operation/linemerge/LineMergeDirectedEdge.h>
#include <geos/operation/linemerge/EdgeString.h>
#include <geos/planargraph/DirectedEdge.h>
#include <geos/planargraph/Edge.h>
#include <geos/planargraph/Node.h>
#include <geos/geom/GeometryComponentFilter.h>
#include <geos/geom/LineString.h>
#include <cassert>
#include <functional>
#include <vector>
using namespace std;
using namespace geos::planargraph;
using namespace geos::geom;
#ifndef GEOS_DEBUG
#define GEOS_DEBUG 0
#endif
namespace geos {
namespace operation { // geos.operation
namespace linemerge { // geos.operation.linemerge
void
LineMerger::add(vector<Geometry*> *geometries)
{
for(size_t i=0, n=geometries->size(); i<n; i++) {
Geometry *geometry=(*geometries)[i];
add(geometry);
}
}
LineMerger::LineMerger():
mergedLineStrings(NULL),
factory(NULL)
{
}
LineMerger::~LineMerger()
{
for (size_t i=0, n=edgeStrings.size(); i<n; ++i) {
delete edgeStrings[i];
}
}
struct LMGeometryComponentFilter: public GeometryComponentFilter {
LineMerger *lm;
LMGeometryComponentFilter(LineMerger *newLm): lm(newLm) {}
void filter(const Geometry *geom) {
const LineString *ls = dynamic_cast<const LineString *>(geom);
if ( ls ) lm->add(ls);
}
};
/**
* Adds a Geometry to be processed. May be called multiple times.
* Any dimension of Geometry may be added; the constituent linework will be
* extracted.
*/
void
LineMerger::add(const Geometry *geometry)
{
LMGeometryComponentFilter lmgcf(this);
geometry->applyComponentFilter(lmgcf);
}
void
LineMerger::add(const LineString *lineString)
{
if (factory==NULL) factory=lineString->getFactory();
graph.addEdge(lineString);
}
void
LineMerger::merge()
{
if (mergedLineStrings!=NULL) return;
buildEdgeStringsForObviousStartNodes();
buildEdgeStringsForIsolatedLoops();
unsigned numEdgeStrings = edgeStrings.size();
mergedLineStrings=new vector<LineString*>(numEdgeStrings);
for (size_t i=0; i<numEdgeStrings; ++i)
{
EdgeString *edgeString=edgeStrings[i];
(*mergedLineStrings)[i]=edgeString->toLineString();
}
}
void
LineMerger::buildEdgeStringsForObviousStartNodes()
{
buildEdgeStringsForNonDegree2Nodes();
}
void
LineMerger::buildEdgeStringsForIsolatedLoops()
{
buildEdgeStringsForUnprocessedNodes();
}
void
LineMerger::buildEdgeStringsForUnprocessedNodes()
{
#if GEOS_DEBUG
cerr<<__FUNCTION__<<endl;
#endif
vector<Node*> *nodes=graph.getNodes();
for (size_t i=0; i<nodes->size(); ++i) {
Node *node=(*nodes)[i];
#if GEOS_DEBUG
cerr<<"Node "<<i<<": "<<*node<<endl;
#endif
if (!node->isMarked()) {
assert(node->getDegree()==2);
buildEdgeStringsStartingAt(node);
node->setMarked(true);
#if GEOS_DEBUG
cerr<<" setMarked(true) : "<<*node<<endl;
#endif
}
}
delete nodes;
}
void
LineMerger::buildEdgeStringsForNonDegree2Nodes()
{
#if GEOS_DEBUG
cerr<<__FUNCTION__<<endl;
#endif
vector<Node*> *nodes=graph.getNodes();
size_t size=nodes->size();
for (size_t i=0; i<size; i++) {
Node *node=(*nodes)[i];
#if GEOS_DEBUG
cerr<<"Node "<<i<<": "<<*node<<endl;
#endif
if (node->getDegree()!=2) {
buildEdgeStringsStartingAt(node);
node->setMarked(true);
#if GEOS_DEBUG
cerr<<" setMarked(true) : "<<*node<<endl;
#endif
}
}
delete nodes;
}
void
LineMerger::buildEdgeStringsStartingAt(Node *node)
{
vector<planargraph::DirectedEdge*> &edges=node->getOutEdges()->getEdges();
size_t size = edges.size();
for (size_t i=0; i<size; i++)
{
assert(dynamic_cast<LineMergeDirectedEdge*>(edges[i]));
LineMergeDirectedEdge *directedEdge=\
static_cast<LineMergeDirectedEdge*> (edges[i]);
if (directedEdge->getEdge()->isMarked()) {
continue;
}
edgeStrings.push_back(buildEdgeStringStartingWith(directedEdge));
}
}
EdgeString*
LineMerger::buildEdgeStringStartingWith(LineMergeDirectedEdge *start)
{
EdgeString *edgeString = new EdgeString(factory);
LineMergeDirectedEdge *current=start;
do {
edgeString->add(current);
current->getEdge()->setMarked(true);
current=current->getNext();
} while (current!=NULL && current!=start);
return edgeString;
}
/**
* Returns the LineStrings built by the merging process.
*/
vector<LineString*>*
LineMerger::getMergedLineStrings()
{
merge();
return mergedLineStrings;
}
} // namespace geos.operation.linemerge
} // namespace geos.operation
} // namespace geos
/**********************************************************************
* $Log$
* Revision 1.15 2006/06/12 11:29:24 strk
* unsigned int => size_t
*
* Revision 1.14 2006/03/22 10:13:54 strk
* opLinemerge.h split
*
* Revision 1.13 2006/03/21 21:42:54 strk
* planargraph.h header split, planargraph:: classes renamed to match JTS symbols
*
**********************************************************************/
|