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
|
/**********************************************************************
* $Id: SnapRounder.cpp,v 1.2 2004/07/02 13:28:27 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 Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************
* $Log: SnapRounder.cpp,v $
* Revision 1.2 2004/07/02 13:28:27 strk
* Fixed all #include lines to reflect headers layout change.
* Added client application build tips in README.
*
* Revision 1.1 2004/03/29 06:59:25 ybychkov
* "noding/snapround" package ported (JTS 1.4);
* "operation", "operation/valid", "operation/relate" and "operation/overlay" upgraded to JTS 1.4;
* "geom" partially upgraded.
*
*
**********************************************************************/
#include <geos/nodingSnapround.h>
namespace geos {
void SnapRounder::setLineIntersector(LineIntersector *newLi) {
li=newLi;
}
vector<SegmentString*>* SnapRounder::node(vector<SegmentString*>* inputSegmentStrings){
vector<SegmentString*> *resultSegStrings=fullyIntersectSegments(inputSegmentStrings, li);
NodingValidator *nv=new NodingValidator(resultSegStrings);
nv->checkValid();
delete nv;
return resultSegStrings;
}
vector<SegmentString*>* SnapRounder::fullyIntersectSegments(vector<SegmentString*>* segStrings, LineIntersector *aLi){
nodingSegmentIntersector *si=NULL;
vector<SegmentString*> *inputSegStrings=segStrings;
vector<SegmentString*> *nodedSegStrings=NULL;
do {
delete si;
si=new nodingSegmentIntersector(aLi);
Noder *noder=new SimpleNoder();
noder->setSegmentIntersector(si);
nodedSegStrings=noder->node(inputSegStrings);
vector<SegmentString*> *snappedSegStrings=computeSnaps(nodedSegStrings);
cout << "interior ints = " << si->numInteriorIntersections <<endl;
//System.out.println("snapRounder result");
//BufferOp.printSegStringList(nodedSegStrings);
inputSegStrings=snappedSegStrings;
delete noder;
} while (si->numInteriorIntersections > 0);
delete si;
return nodedSegStrings;
}
/**
* Computes new nodes introduced as a result of snapping segments to near vertices
* @param li
*/
vector<SegmentString*>* SnapRounder::computeSnaps(vector<SegmentString*> *segStrings){
vector<SegmentString*> *splitSegStringList=NULL;
int numSnaps;
/**
* Have to snap repeatedly, because snapping a line may move it enough
* that it crosses another hot pixel.
*/
do {
SimpleSegmentStringsSnapper *snapper = new SimpleSegmentStringsSnapper();
SegmentSnapper *ss = new SegmentSnapper();
snapper->computeNodes(segStrings, ss, true);
numSnaps = snapper->getNumSnaps();
// save the list of split seg strings in case we are going to return it
splitSegStringList = Noder::getNodedEdges(segStrings);
segStrings = splitSegStringList;
} while (numSnaps > 0);
return splitSegStringList;
}
}
|
