/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/triangulate/ |
H A D | SplitSegment.java | 43 private Coordinate splitPt; field in SplitSegment 56 return splitPt; in getSplitPoint() 63 splitPt = seg.pointAlong(frac); in splitAt() 65 splitPt = pointAlongReverse(seg, frac); in splitAt() 72 splitPt = seg.pointAlong(minFrac); in splitAt() 76 splitPt = pointAlongReverse(seg, minFrac); in splitAt() 80 splitPt = pt; in splitAt()
|
H A D | ConformingDelaunayTriangulator.java | 95 private Coordinate splitPt = null; field in ConformingDelaunayTriangulator 403 splitPt); in enforceConstraints() 441 splitPt = splitFinder.findSplitPoint(seg, encroachPt); in enforceGabriel() 442 ConstraintVertex splitVertex = createVertex(splitPt, seg); in enforceGabriel() 463 if (!insertedVertex.getCoordinate().equals2D(splitPt)) { in enforceGabriel()
|
/dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/ |
H A D | curve_on_manifold.h | 714 bool TestSplitSegWithMesh(VertexType *v0, VertexType *v1, CoordType &splitPt) in TestSplitSegWithMesh() argument 777 splitPt = bestSplitPt; in TestSplitSegWithMesh() 865 bool TestSplitSegWithMeshAdapt(VertexType *v0, VertexType *v1, CoordType &splitPt) in TestSplitSegWithMeshAdapt() argument 867 splitPt=(v0->P()+v1->P())/2.0; in TestSplitSegWithMeshAdapt() 872 FaceType *fm=GetClosestFaceIP(splitPt,ipm); in TestSplitSegWithMeshAdapt() 880 splitPt = fm->P(0)*ipm[0]+fm->P(1)*ipm[1]+fm->P(2)*ipm[2]; in TestSplitSegWithMeshAdapt() 931 splitPt=(v0->P()+v1->P())/2.0; in TestSplitSegWithMeshAdaptOld() 950 splitPt=(v0->P()+v1->P())/2.0; in TestSplitSegWithMeshAdaptOld() 1032 CoordType splitPt; in RefineCurveByBaseMesh() local 1033 if(TestSplitSegWithMeshAdapt(e.V(0),e.V(1),splitPt)) in RefineCurveByBaseMesh() [all …]
|
/dports/graphics/nurbs++/nurbs++-3.0.11/nurbs/ |
H A D | nurbsSub.cpp | 1209 int * splitPt, /* Where the knot interval is split */ in SplitKV() argument 1267 *splitPt = (extra < k) ? middex - 1 : middex; in SplitKV() 1486 int i, j, splitPt; in SplitSurface() local 1513 &splitPt, in SplitSurface() 1524 &splitPt, in SplitSurface() 1556 kid0->numU = dirflag ? splitPt+1 : parent->numU; in SplitSurface() 1557 kid0->numV = dirflag ? parent->numV : splitPt+1; in SplitSurface() 1571 splitPt++; in SplitSurface() 1596 = tmp->points(dirflag ? i: (i + splitPt) ,dirflag ? (j + splitPt) : j); in SplitSurface() 1598 kid1->kvU[i] = tmp->kvU[dirflag ? (i + splitPt) : i]; in SplitSurface() [all …]
|
H A D | d_nurbsSub.cpp | 48 template int SplitKV( double * srckv,double ** destkv,int * splitPt,int m, int k );
|
H A D | f_nurbsSub.cpp | 48 template int SplitKV( float * srckv,float ** destkv,int * splitPt,int m, int k );
|
/dports/net/mpich2/mpich2-1.5/src/mpe2/src/graphics/contrib/mandel/ |
H A D | pm_separate_rect.c | 48 int inProgress, nidle, *idleList, splitPt, np, data, local 97 splitPt = winspecs->height + 100 RECT_ASSIGN( tempRect, 0, winspecs->width-1, 0, splitPt-1 ); 103 RECT_ASSIGN( tempRect, 0, winspecs->width-1, splitPt, winspecs->height-1 );
|
/dports/cad/openroad/OpenROAD-2.0/src/TritonRoute/src/dr/ |
H A D | FlexDR_conn.cpp | 716 auto& [splitPt, lNum] = pr; in checkConnectivity_final() 725 if (prPt.x() <= splitPt.x()) { in checkConnectivity_final() 730 if (prPt.x() >= splitPt.x()) { in checkConnectivity_final() 735 if (prPt.y() <= splitPt.y()) { in checkConnectivity_final() 740 if (prPt.y() >= splitPt.y()) { in checkConnectivity_final() 762 ps1->setPoints(bp1, splitPt); in checkConnectivity_final() 770 ps2->setPoints(splitPt, ep1); in checkConnectivity_final()
|
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/geom/ |
H A D | Triangle.java | 314 Coordinate splitPt = new Coordinate(a.x + frac * dx, a.y + frac * dy); in angleBisector() local 315 return splitPt; in angleBisector()
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/s/commands/ |
H A D | cluster_map_reduce_cmd.cpp | 383 for (const auto& splitPt : splitKeys.Array()) { in errmsgRun() local 384 splitPts.insert(splitPt.Obj().getOwned()); in errmsgRun()
|