static S2Point |
S2Point.add(S2Point p1,
S2Point p2) |
void |
S2PolygonBuilder.addEdge(S2Point v0,
S2Point v1) |
void |
S2EdgeUtil.XYZPruner.addEdgeToBounds(S2Point from,
S2Point to) |
S2Cap |
S2Cap.addPoint(S2Point p) |
void |
S2EdgeUtil.RectBounder.addPoint(S2Point b) |
S2LatLngRect |
S2LatLngRect.addPoint(S2Point p) |
double |
S2Point.angle(S2Point va) |
static double |
S2.angle(S2Point a,
S2Point b,
S2Point c) |
static boolean |
S2.approxEquals(S2Point a,
S2Point b) |
static boolean |
S2.approxEquals(S2Point a,
S2Point b,
double maxError) |
int |
S2Point.compareTo(S2Point other) |
boolean |
S2Cell.contains(S2Point p) |
boolean |
S2Loop.contains(S2Point p) |
boolean |
S2Cap.contains(S2Point p) |
boolean |
S2Polygon.contains(S2Point p) |
boolean |
S2LatLngRect.contains(S2Point p) |
boolean |
S2CellUnion.contains(S2Point p) |
static S2Point |
S2Point.crossProd(S2Point p1,
S2Point p2) |
static S2Point |
S2Point.div(S2Point p,
double m) |
double |
S2Point.dotProd(S2Point that) |
protected void |
S2PolygonBuilder.dumpEdges(S2Point v0) |
boolean |
S2EdgeUtil.EdgeCrosser.edgeOrVertexCrossing(S2Point d) |
static boolean |
S2EdgeUtil.edgeOrVertexCrossing(S2Point a,
S2Point b,
S2Point c,
S2Point d) |
static S2Point |
S2Point.fabs(S2Point p) |
static R2Vector |
S2Projections.faceXyzToUv(int face,
S2Point p) |
protected void |
S2EdgeIndex.findCandidateCrossings(S2Point a,
S2Point b,
List<Integer> candidateCrossings) |
static S2Cap |
S2Cap.fromAxisAngle(S2Point axis,
S1Angle angle) |
static S2Cap |
S2Cap.fromAxisArea(S2Point axis,
double area) |
static S2Cap |
S2Cap.fromAxisHeight(S2Point axis,
double height) |
static S2LatLngRect |
S2LatLngRect.fromEdge(S2Point a,
S2Point b) |
static S2CellId |
S2CellId.fromPoint(S2Point p) |
void |
S2EdgeIndex.DataEdgeIterator.getCandidates(S2Point a,
S2Point b) |
static S2Point |
S2EdgeUtil.getClosestPoint(S2Point x,
S2Point a,
S2Point b) |
S1Angle |
S2Loop.getDistance(S2Point p) |
S1Angle |
S2Polygon.getDistance(S2Point p) |
static S1Angle |
S2EdgeUtil.getDistance(S2Point x,
S2Point a,
S2Point b) |
static S1Angle |
S2EdgeUtil.getDistance(S2Point x,
S2Point a,
S2Point b,
S2Point aCrossB) |
static double |
S2EdgeUtil.getDistanceFraction(S2Point x,
S2Point a0,
S2Point a1) |
static S2Point |
S2EdgeUtil.getIntersection(S2Point a0,
S2Point a1,
S2Point b0,
S2Point b1) |
int |
S2Polyline.getNearestEdgeIndex(S2Point point) |
static void |
S2RegionCoverer.getSimpleCovering(S2Region region,
S2Point start,
int level,
ArrayList<S2CellId> output) |
static double |
S2.girardArea(S2Point a,
S2Point b,
S2Point c) |
boolean |
S2Cap.interiorContains(S2Point p) |
boolean |
S2LatLngRect.interiorContains(S2Point p) |
boolean |
S2Cap.intersects(S2Cell cell,
S2Point[] vertices) |
boolean |
S2EdgeUtil.XYZPruner.intersects(S2Point v1) |
boolean |
S2EdgeUtil.LongitudePruner.intersects(S2Point v1) |
static boolean |
S2.isUnitLength(S2Point p) |
static S1Angle |
S2LatLng.latitude(S2Point p) |
boolean |
S2Point.lessThan(S2Point vb) |
static S1Angle |
S2LatLng.longitude(S2Point p) |
static S2Point |
S2Point.minus(S2Point p1,
S2Point p2) |
static S2Point |
S2Point.mul(S2Point p,
double m) |
static S2Point |
S2Point.neg(S2Point p) |
static S2Point |
S2Point.normalize(S2Point p) |
static boolean |
S2.orderedCCW(S2Point a,
S2Point b,
S2Point c,
S2Point o) |
static S2Point |
S2.ortho(S2Point a) |
static S2Point |
S2.planarCentroid(S2Point a,
S2Point b,
S2Point c) |
S2Point |
S2Polyline.projectToEdge(S2Point point,
int index) |
void |
S2EdgeUtil.EdgeCrosser.restartAt(S2Point c) |
static int |
S2.robustCCW(S2Point a,
S2Point b,
S2Point c) |
static int |
S2.robustCCW(S2Point a,
S2Point b,
S2Point c,
S2Point aCrossB) |
int |
S2EdgeUtil.EdgeCrosser.robustCrossing(S2Point d) |
static int |
S2EdgeUtil.robustCrossing(S2Point a,
S2Point b,
S2Point c,
S2Point d) |
static S2Point |
S2.robustCrossProd(S2Point a,
S2Point b) |
void |
S2EdgeUtil.XYZPruner.setFirstIntersectPoint(S2Point v0) |
static double |
S2.signedArea(S2Point a,
S2Point b,
S2Point c) |
static boolean |
S2.simpleCCW(S2Point a,
S2Point b,
S2Point c) |
static boolean |
S2.simpleCrossing(S2Point a,
S2Point b,
S2Point c,
S2Point d) |
static boolean |
S2EdgeUtil.simpleCrossing(S2Point a,
S2Point b,
S2Point c,
S2Point d) |
static S2Point |
S2Point.sub(S2Point p1,
S2Point p2) |
int |
S2EdgeUtil.WedgeRelation.test(S2Point a0,
S2Point ab1,
S2Point a2,
S2Point b0,
S2Point b2) |
int |
S2EdgeUtil.WedgeContains.test(S2Point a0,
S2Point ab1,
S2Point a2,
S2Point b0,
S2Point b2) |
int |
S2EdgeUtil.WedgeIntersects.test(S2Point a0,
S2Point ab1,
S2Point a2,
S2Point b0,
S2Point b2) |
int |
S2EdgeUtil.WedgeContainsOrIntersects.test(S2Point a0,
S2Point ab1,
S2Point a2,
S2Point b0,
S2Point b2) |
int |
S2EdgeUtil.WedgeContainsOrCrosses.test(S2Point a0,
S2Point ab1,
S2Point a2,
S2Point b0,
S2Point b2) |
static S2Point |
S2.trueCentroid(S2Point a,
S2Point b,
S2Point c) |
static double |
S2.turnAngle(S2Point a,
S2Point b,
S2Point c) |
static R2Vector |
S2Projections.validFaceXyzToUv(int face,
S2Point p) |
static boolean |
S2EdgeUtil.vertexCrossing(S2Point a,
S2Point b,
S2Point c,
S2Point d) |
static int |
S2Projections.xyzToFace(S2Point p) |