Home
last modified time | relevance | path

Searched refs:intPt (Results 1 – 25 of 47) sorted by relevance

12

/dports/graphics/geos/geos-3.9.1/tests/unit/algorithm/
H A DRobustLineIntersectionTest.cpp70 if(intPt.empty()) { in checkIntersection()
74 ensure_equals(intPt.size(), intNum); in checkIntersection()
141 std::vector<Coordinate> intPt; in checkIntersection() local
143 intPt.push_back(cs->getAt(i)); in checkIntersection()
203 std::vector<Coordinate> intPt; in checkIntersectionNone() local
314 std::vector<Coordinate> intPt;
322 intPt, 0);
333 std::vector<Coordinate> intPt;
340 intPt, 0);
358 std::vector<Coordinate> intPt;
[all …]
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/algorithm/
H A DRobustLineIntersector.java161 intPt[0] = copyWithZ(p, z); in computeIntersect()
173 intPt[0] = copyWithZInterpolate(q1, p1, p2); in computeCollinearIntersection()
260 if (! isInSegmentEnvelopes(intPt)) { in intersection()
273 precisionModel.makePrecise(intPt); in intersection()
275 return intPt; in intersection()
279 Coordinate q2, Coordinate intPt) in checkDD() argument
284 if (intPt.distance(intPtDD) > 0.0001) { in checkDD()
304 if (intPt == null) in intersectionSafe()
305 intPt = nearestEndpoint(p1, p2, q1, q2); in intersectionSafe()
307 return intPt; in intersectionSafe()
[all …]
H A DLineIntersector.java145 protected Coordinate[] intPt = new Coordinate[2]; field in LineIntersector
162 intPt[0] = new Coordinate(); in LineIntersector()
163 intPt[1] = new Coordinate(); in LineIntersector()
165 pa = intPt[0]; in LineIntersector()
166 pb = intPt[1]; in LineIntersector()
289 public Coordinate getIntersection(int intIndex) { return intPt[intIndex]; } in getIntersection()
310 if (intPt[i].equals2D(pt)) { in isIntersection()
337 if (! ( intPt[i].equals2D(inputLines[inputLineIndex][0]) in isInteriorIntersection()
338 || intPt[i].equals2D(inputLines[inputLineIndex][1]) )) { in isInteriorIntersection()
375 return intPt[intLineIndex[segmentIndex][intIndex]]; in getIntersectionAlongSegment()
[all …]
H A DInteriorPointPoint.java38 InteriorPointPoint intPt = new InteriorPointPoint(geom); in getInteriorPoint() local
39 return intPt.getInteriorPoint(); in getInteriorPoint()
/dports/math/jts/jts-jts-1.18.1/modules/core/src/test/java/test/jts/perf/algorithm/
H A DIntersectionPerfTest.java84 Coordinate intPt = IntersectionAlgorithms.intersectionBasic(p0, p1, q0, q1); in runDP() local
89 Coordinate intPt = CGAlgorithmsDD.intersection(p0, p1, q0, q1); in runDD() local
94 Coordinate intPt = IntersectionAlgorithms.intersectionDDWithFilter(p0, p1, q0, q1); in runDDWithFilter() local
99 Coordinate intPt = IntersectionAlgorithms.intersectionCB(p0, p1, q0, q1); in runCB() local
104 Coordinate intPt = Intersection.intersection(p0, p1, q0, q1); in runCond() local
109 Coordinate intPt = IntersectionAlgorithms.intersectionBasic(a0, a1, b0, b1); in runDP_easy() local
114 Coordinate intPt = Intersection.intersection(a0, a1, b0, b1); in runCond_easy() local
119 Coordinate intPt = CGAlgorithmsDD.intersection(a0, a1, b0, b1); in runDD_easy() local
124 Coordinate intPt = IntersectionAlgorithms.intersectionDDWithFilter(a0, a1, b0, b1); in runDDWithFilter_easy() local
H A DIntersectionAlgorithms.java51 Coordinate intPt = intersectionDDFilter(p1, p2, q1, q2); in intersectionDDWithFilter() local
52 if (intPt != null) in intersectionDDWithFilter()
53 return intPt; in intersectionDDWithFilter()
61 Coordinate intPt = intersectionBasic(p1, p2, q1, q2); in intersectionDDFilter() local
62 if (intPt == null) in intersectionDDFilter()
64 if (Distance.pointToLinePerpendicular(intPt, p1, p2) > FILTER_TOL) in intersectionDDFilter()
66 if (Distance.pointToLinePerpendicular(intPt, q1, q2) > FILTER_TOL) in intersectionDDFilter()
68 return intPt; in intersectionDDFilter()
H A DIntersectionStressTest.java103 Coordinate intPt = IntersectionAlgorithms.intersectionBasic(p1, p2, q1, q2); in doIntersectionTest() local
112 printStats("DP ", intPt, p1, p2, q1, q2); in doIntersectionTest()
118 …private void printStats(String tag, Coordinate intPt, Coordinate p1, Coordinate p2, Coordinate q1,… in printStats() argument
119 double distP = Distance.pointToLinePerpendicular(intPt, p1, p2); in printStats()
120 double distQ = Distance.pointToLinePerpendicular(intPt, q1, q2); in printStats()
125 + WKTWriter.toPoint(intPt) in printStats()
/dports/graphics/geos/geos-3.9.1/src/algorithm/
H A DLineIntersector.cpp144 if(intPt[i].equals2D(pt)) { in isIntersection()
157 return intPt[intLineIndex[segmentIndex][intIndex]]; in getIntersectionAlongSegment()
188 double dist = computeEdgeDistance(intPt[intIndex], in getEdgeDistance()
466 intPt[0] = Coordinate(p.x, p.y, z); in computeIntersect()
494 intPt[0] = zGetOrInterpolateCopy(q1, p1, p2); in computeCollinearIntersection()
495 intPt[1] = zGetOrInterpolateCopy(q2, p1, p2); in computeCollinearIntersection()
506 intPt[0] = zGetOrInterpolateCopy(p1, q1, q2); in computeCollinearIntersection()
507 intPt[1] = zGetOrInterpolateCopy(p2, q1, q2); in computeCollinearIntersection()
515 intPt[0] = zGetOrInterpolateCopy(q1, p1, p2); in computeCollinearIntersection()
516 intPt[1] = zGetOrInterpolateCopy(p1, q1, q2); in computeCollinearIntersection()
[all …]
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/overlayng/
H A DRingClipper.java105 Coordinate intPt = intersection(p0, p1, edgeIndex); in clipToBoxEdge() local
106 ptsClip.add( intPt, false); in clipToBoxEdge()
112 Coordinate intPt = intersection(p0, p1, edgeIndex); in clipToBoxEdge() local
113 ptsClip.add( intPt, false); in clipToBoxEdge()
141 Coordinate intPt; in intersection() local
144 intPt = new Coordinate(intersectionLineY(a, b, clipEnvMinY), clipEnvMinY); in intersection()
147 intPt = new Coordinate(clipEnvMaxX, intersectionLineX(a, b, clipEnvMaxX)); in intersection()
150 intPt = new Coordinate(intersectionLineY(a, b, clipEnvMaxY), clipEnvMaxY); in intersection()
154 intPt = new Coordinate(clipEnvMinX, intersectionLineX(a, b, clipEnvMinX)); in intersection()
156 return intPt; in intersection()
/dports/math/jts/jts-jts-1.18.1/modules/app/src/main/java/org/locationtech/jtstest/function/
H A DLineSegmentFunctions.java69 Coordinate intPt = CGAlgorithmsDD.intersection(pt1[0], pt1[1], pt2[0], pt2[1]); in segmentIntersectionDD() local
70 return g1.getFactory().createPoint(intPt); in segmentIntersectionDD()
81 Coordinate intPt = line1.lineIntersection(line2); in lineIntersection() local
82 return g1.getFactory().createPoint(intPt); in lineIntersection()
90 Coordinate intPt = CGAlgorithmsDD.intersection(pt1[0], pt1[1], pt2[0], pt2[1] ); in lineIntersectionDD() local
92 if (Double.isNaN(intPt.getX())) { in lineIntersectionDD()
93 intPt = null; in lineIntersectionDD()
95 return g1.getFactory().createPoint(intPt); in lineIntersectionDD()
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/noding/
H A DNodedSegmentString.java165 Coordinate intPt = new Coordinate(li.getIntersection(intIndex)); in addIntersection() local
166 addIntersection(intPt, segmentIndex); in addIntersection()
175 public void addIntersection(Coordinate intPt, int segmentIndex) { in addIntersection() argument
176 addIntersectionNode(intPt, segmentIndex); in addIntersection()
188 public SegmentNode addIntersectionNode(Coordinate intPt, int segmentIndex) { in addIntersectionNode() argument
199 if (intPt.equals2D(nextPt)) { in addIntersectionNode()
207 SegmentNode ei = nodeList.add(intPt, normalizedSegmentIndex); in addIntersectionNode()
H A DSegmentIntersectionDetector.java39 private Coordinate intPt = null; field in SegmentIntersectionDetector
118 return intPt; in getIntersection()
176 if (intPt == null || saveLocation) { in processIntersections()
179 intPt = li.getIntersection(0); in processIntersections()
H A DNodingValidator.java131 Coordinate intPt = li.getIntersection(i); in hasInteriorIntersection() local
132 if (! (intPt.equals(p0) || intPt.equals(p1))) in hasInteriorIntersection()
/dports/graphics/geos/geos-3.9.1/src/operation/overlayng/
H A DRingClipper.cpp52 Coordinate intPt; in clipToBoxEdge() local
53 intersection(p0, p1, edgeIndex, intPt); in clipToBoxEdge()
54 ptsClip->add(intPt, false); in clipToBoxEdge()
61 Coordinate intPt; in clipToBoxEdge() local
62 intersection(p0, p1, edgeIndex, intPt); in clipToBoxEdge()
63 ptsClip->add(intPt, false); in clipToBoxEdge()
/dports/graphics/geos/geos-3.9.1/src/noding/
H A DNodedSegmentString.cpp84 const Coordinate& intPt = li->getIntersection(intIndex); in addIntersection() local
85 addIntersection(intPt, segmentIndex); in addIntersection()
90 NodedSegmentString::addIntersection(const Coordinate& intPt, in addIntersection() argument
107 if(intPt.equals2D(nextPt)) { in addIntersection()
116 nodeList.add(intPt, normalizedSegmentIndex); in addIntersection()
H A DSegmentIntersectionDetector.cpp69 if(!intPt || saveLocation) { in processIntersections()
71 intPt = &li->getIntersection(0); in processIntersections()
/dports/math/jts/jts-jts-1.18.1/modules/lab/src/main/java/org/locationtech/jtslab/edgeray/
H A DEdgeRayIntersectionArea.java84 Coordinate intPt = li.getIntersection(0); in addIntersections() local
89 area += EdgeRay.areaTerm(intPt, a0, a1, true); in addIntersections()
90 area += EdgeRay.areaTerm(intPt, b1, b0, false); in addIntersections()
93 area += EdgeRay.areaTerm(intPt, a1, a0, false); in addIntersections()
94 area += EdgeRay.areaTerm(intPt, b0, b1, true); in addIntersections()
/dports/graphics/geos/geos-3.9.1/include/geos/noding/
H A DSegmentIntersectionDetector.h53 const geom::Coordinate* intPt; variable
66 intPt(nullptr), in SegmentIntersectionDetector()
131 return intPt; in getIntersection()
H A DNodedSegmentString.h125 addIntersectionNode(geom::Coordinate* intPt, std::size_t segmentIndex) in addIntersectionNode() argument
137 if(intPt->equals2D(nextPt)) { in addIntersectionNode()
143 SegmentNode* ei = getNodeList().add(*intPt, normalizedSegmentIndex); in addIntersectionNode()
202 void addIntersection(const geom::Coordinate& intPt,
H A DSegmentNodeList.h160 SegmentNode* add(const geom::Coordinate& intPt, std::size_t segmentIndex);
163 add(const geom::Coordinate* intPt, std::size_t segmentIndex) in add() argument
165 return add(*intPt, segmentIndex); in add()
/dports/graphics/geos/geos-3.9.1/src/geomgraph/
H A DEdge.cpp176 const Coordinate& intPt = li->getIntersection(intIndex); in addIntersection() local
187 if(intPt.equals2D(nextPt)) { in addIntersection()
197 …cerr << "Edge::addIntersection adding to edge intersection list point " << intPt.toString() << end… in addIntersection()
199 eiList.add(intPt, normalizedSegmentIndex, dist); in addIntersection()
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/distance3d/
H A DDistance3DOp.java386 Coordinate intPt = intersection(poly, line); in computeMinDistancePolygonLine() local
387 if (intPt != null) { in computeMinDistancePolygonLine()
389 new GeometryLocation(poly.getPolygon(), 0, intPt), in computeMinDistancePolygonLine()
390 new GeometryLocation(line, 0, intPt), in computeMinDistancePolygonLine()
437 Coordinate intPt = segmentPoint(p0, p1, d0, d1); in intersection() local
439 if (poly.intersects(intPt)) { in intersection()
440 return intPt; in intersection()
/dports/math/jts/jts-jts-1.18.1/modules/core/src/test/java/org/locationtech/jts/algorithm/
H A DRobustLineIntersectionTest.java252 Coordinate[] intPt, in checkIntersection() argument
262 checkIntersection(pt, expectedIntersectionNum, intPt, distanceTolerance); in checkIntersection()
278 Coordinate[] intPt = g.getCoordinates(); in checkIntersection() local
279 checkIntersection(pt, expectedIntersectionNum, intPt, distanceTolerance); in checkIntersection()
/dports/graphics/geos/geos-3.9.1/src/geom/
H A DLineSegment.cpp191 Coordinate intPt = intersection(line); in closestPoints() local
192 if(!intPt.isNull()) { in closestPoints()
193 return { intPt, intPt }; in closestPoints()
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/geom/
H A DLineSegment.java504 Coordinate intPt = intersection(line); in closestPoints() local
505 if (intPt != null) { in closestPoints()
506 return new Coordinate[] { intPt, intPt }; in closestPoints()
591 Coordinate intPt = Intersection.intersection(p0, p1, line.p0, line.p1); in lineIntersection() local
592 return intPt; in lineIntersection()

12