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 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271
|
/**********************************************************************
* $Id: SimpleSnapRounder.cpp 1820 2006-09-06 16:54:23Z mloskot $
*
* GEOS - Geometry Engine Open Source
* http://geos.refractions.net
*
* Copyright (C) 2006 Refractions Research Inc.
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU Lesser General Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************
*
* Last port: noding/snapround/SimpleSnapRounder.java rev. 1.2 (JTS-1.7)
*
**********************************************************************/
#include <geos/noding/snapround/SimpleSnapRounder.h>
#include <geos/noding/snapround/HotPixel.h>
#include <geos/noding/SegmentString.h>
#include <geos/noding/NodingValidator.h>
#include <geos/noding/MCIndexNoder.h>
#include <geos/noding/IntersectionFinderAdder.h>
#include <geos/geom/Coordinate.h>
#include <geos/geom/CoordinateSequence.h>
#include <geos/algorithm/LineIntersector.h>
#include <geos/algorithm/LineIntersector.h>
#include <vector>
#include <exception>
#include <iostream>
#include <cassert>
using namespace std;
using namespace geos::algorithm;
using namespace geos::geom;
namespace geos {
namespace noding { // geos.noding
namespace snapround { // geos.noding.snapround
/*public*/
SimpleSnapRounder::SimpleSnapRounder(const geom::PrecisionModel& newPm)
:
pm(newPm),
li(&newPm),
scaleFactor(newPm.getScale())
{
}
/*public*/
std::vector<SegmentString*>*
SimpleSnapRounder::getNodedSubstrings() const
{
return nodedSegStrings;
}
/*public*/
void
SimpleSnapRounder::computeNodes(
std::vector<SegmentString*>* inputSegmentStrings)
{
nodedSegStrings = inputSegmentStrings;
snapRound(inputSegmentStrings, li);
// testing purposes only - remove in final version
assert(nodedSegStrings == inputSegmentStrings);
checkCorrectness(*inputSegmentStrings);
}
/*private*/
void
SimpleSnapRounder::checkCorrectness(
SegmentString::NonConstVect& inputSegmentStrings)
{
auto_ptr<SegmentString::NonConstVect> resultSegStrings(
SegmentString::getNodedSubstrings(inputSegmentStrings)
);
NodingValidator nv(*(resultSegStrings.get()));
try {
nv.checkValid();
} catch (const std::exception &ex) {
std::cerr << ex.what() << std::endl;
throw;
}
}
/*private*/
void
SimpleSnapRounder::computeSnaps(const SegmentString::NonConstVect& segStrings,
vector<Coordinate>& snapPts)
{
for (SegmentString::NonConstVect::const_iterator
i=segStrings.begin(), iEnd=segStrings.end();
i!=iEnd; ++i)
{
SegmentString* ss = *i;
ss->testInvariant();
computeSnaps(ss, snapPts);
}
}
/*private*/
void
SimpleSnapRounder::computeSnaps(SegmentString* ss, vector<Coordinate>& snapPts)
{
for (vector<Coordinate>::iterator
it=snapPts.begin(), itEnd=snapPts.end();
it!=itEnd; ++it)
{
const Coordinate& snapPt = *it;
HotPixel hotPixel(snapPt, scaleFactor, li);
for (int i=0, n=ss->size()-1; i<n; ++i) {
addSnappedNode(hotPixel, *ss, i);
}
}
}
/* public static */
bool
SimpleSnapRounder::addSnappedNode(const HotPixel& hotPix,
SegmentString& segStr, unsigned int segIndex)
{
const Coordinate& p0 = segStr.getCoordinate(segIndex);
const Coordinate& p1 = segStr.getCoordinate(segIndex + 1);
if (hotPix.intersects(p0, p1)) {
//cerr<<"snapped: "<<snapPt<<endl;
//cerr<<"POINT ("<<snapPt.x<<" "<<snapPt.y<<")"<<endl;
segStr.addIntersection(hotPix.getCoordinate(), segIndex);
return true;
}
return false;
}
/*private*/
void
SimpleSnapRounder::computeVertexSnaps(SegmentString* e0, SegmentString* e1)
{
const CoordinateSequence* pts0 = e0->getCoordinates();
const CoordinateSequence* pts1 = e1->getCoordinates();
for (unsigned int i0=0, n0=pts0->getSize()-1; i0<n0; i0++)
{
const Coordinate& p0 = pts0->getAt(i0);
HotPixel hotPixel(p0, scaleFactor, li);
for (unsigned int i1=1, n1=pts1->getSize()-1; i1<n1; i1++)
{
// don't snap a vertex to itself
if (i0 == i1 && e0 == e1) {
continue;
}
//cerr<<"trying "<<p0<<" against "<<pts1->getAt(i1)<<" "<<pts1->getAt(i1 + 1)<<endl;
bool isNodeAdded = addSnappedNode(hotPixel, *e1, i1);
// if a node is created for a vertex, that vertex must be noded too
if (isNodeAdded) {
e0->addIntersection(p0, i0);
}
}
}
}
/*public*/
void
SimpleSnapRounder::computeVertexSnaps(const SegmentString::NonConstVect& edges)
{
for (SegmentString::NonConstVect::const_iterator
i0=edges.begin(), i0End=edges.end();
i0!=i0End; ++i0)
{
SegmentString* edge0 = *i0;
for (SegmentString::NonConstVect::const_iterator
i1=edges.begin(), i1End=edges.end();
i1!=i1End; ++i1)
{
SegmentString* edge1 = *i1;
computeVertexSnaps(edge0, edge1);
}
}
}
/*private*/
void
SimpleSnapRounder::snapRound(SegmentString::NonConstVect* segStrings,
LineIntersector& li)
{
assert(segStrings);
vector<Coordinate> intersections;
findInteriorIntersections(*segStrings, li, intersections);
computeSnaps(*segStrings, intersections);
computeVertexSnaps(*segStrings);
}
/*private*/
void
SimpleSnapRounder::findInteriorIntersections(
SegmentString::NonConstVect& segStrings,
LineIntersector& li, vector<Coordinate>& ret)
{
IntersectionFinderAdder intFinderAdder(li, ret);
MCIndexNoder noder;
noder.setSegmentIntersector(&intFinderAdder);
noder.computeNodes(&segStrings);
//intFinderAdder.getInteriorIntersections();
}
} // namespace geos.noding.snapround
} // namespace geos.noding
} // namespace geos
/**********************************************************************
* $Log$
* Revision 1.11 2006/05/05 15:40:39 strk
* Had nodind validation error throw an exception for SimpleSnapRounder
* and MCIndexSnapRounder
*
* Revision 1.10 2006/05/03 17:54:58 strk
* Uncommented correctness checker
*
* Revision 1.9 2006/05/03 15:49:16 strk
* fixed bug in SimpleSnapRounder::computeSnaps, trying to access out-of-bound vector element.
*
* Revision 1.8 2006/05/03 15:02:49 strk
* moved some implementations from header to .cpp file (taken out of inline)
*
* Revision 1.7 2006/03/15 09:51:13 strk
* streamlined headers usage
*
* Revision 1.6 2006/03/03 10:46:21 strk
* Removed 'using namespace' from headers, added missing headers in .cpp files, removed useless includes in headers (bug#46)
*
* Revision 1.5 2006/02/21 16:53:49 strk
* MCIndexPointSnapper, MCIndexSnapRounder
*
* Revision 1.4 2006/02/19 19:46:49 strk
* Packages <-> namespaces mapping for most GEOS internal code (uncomplete, but working). Dir-level libs for index/ subdirs.
*
* Revision 1.3 2006/02/18 21:08:09 strk
* - new CoordinateSequence::applyCoordinateFilter method (slow but useful)
* - SegmentString::getCoordinates() doesn't return a clone anymore.
* - SegmentString::getCoordinatesRO() obsoleted.
* - SegmentString constructor does not promises constness of passed
* CoordinateSequence anymore.
* - NEW ScaledNoder class
* - Stubs for MCIndexPointSnapper and MCIndexSnapRounder
* - Simplified internal interaces of OffsetCurveBuilder and OffsetCurveSetBuilder
*
* Revision 1.2 2006/02/15 17:19:18 strk
* NodingValidator synced with JTS-1.7, added CoordinateSequence::operator[]
* and size() to easy port maintainance.
*
* Revision 1.1 2006/02/14 13:28:26 strk
* New SnapRounding code ported from JTS-1.7 (not complete yet).
* Buffer op optimized by using new snaprounding code.
* Leaks fixed in XMLTester.
*
**********************************************************************/
|