Home
last modified time | relevance | path

Searched defs:crossing (Results 1 – 9 of 9) sorted by relevance

/external/skia/modules/bentleyottmann/include/
DSegment.h35 const Point crossing; member
/external/skia/modules/bentleyottmann/tests/
DSweepLineTest.cpp54 const Point crossing = {0, 0}; in DEF_TEST() local
82 const Point crossing = {0, 0}; in DEF_TEST() local
DEventQueueTest.cpp177 for (const Crossing& crossing : fCrossings) { in handleInsertionsAndCheckForNewCrossings() local
/external/apache-commons-math/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/
DSubLine.java177 final Vector2D crossing = thisLine.intersection(otherLine); in split() local
/external/s2-geometry-library-java/tests/com/google/common/geometry/
DS2EdgeIndexTest.java107 int crossing = S2EdgeUtil.robustCrossing( in checkAllCrossings() local
/external/harfbuzz_ng/src/
Dhb-subset-instancer-solver.cc176 double crossing = peak + (1 - gain) * (upper - peak); in _solve() local
/external/s2-geometry-library-java/src/com/google/common/geometry/
DS2EdgeUtil.java129 int crossing = robustCrossing(d); in edgeOrVertexCrossing() local
631 int crossing = robustCrossing(a, b, c, d); in edgeOrVertexCrossing() local
DS2Polygon.java561 int crossing, in addIntersection()
605 int crossing = crosser.robustCrossing(to); in clipEdge() local
DS2Loop.java913 int crossing = crosser.robustCrossing(vertex(i + 1)); in checkEdgeCrossings() local