Uses of Class
com.google.common.geometry.S2Cell

  • Uses of S2Cell in com.google.common.geometry

    Methods in com.google.common.geometry that return S2Cell
    Modifier and Type
    Method
    Description
    static S2Cell
    S2Cell.fromFace(int face)
    Returns the cell corresponding to the given S2 cube face.
    static S2Cell
    S2Cell.fromFacePosLevel(int face, long pos, int level)
    Returns a cell given its face (range 0..5), Hilbert curve position within that face (an unsigned integer with S2CellId.POS_BITS bits), and level (range 0..kMaxLevel).
    Methods in com.google.common.geometry with parameters of type S2Cell
    Modifier and Type
    Method
    Description
    boolean
    S2Cap.contains(S2Cell cell)
     
    boolean
    S2Cell.contains(S2Cell cell)
     
    boolean
    S2CellUnion.contains(S2Cell cell)
    This is a fast operation (logarithmic in the size of the cell union).
    final boolean
    S2LatLngRectBase.contains(S2Cell cell)
    Returns true if this latitude/longitude region contains the given cell.
    boolean
    S2Loop.contains(S2Cell target)
    If this method returns true, the region completely contains the given cell.
    boolean
    S2Point.contains(S2Cell cell)
     
    boolean
    S2PointRegion.contains(S2Cell cell)
     
    boolean
    S2Polygon.contains(S2Cell cell)
    If this method returns true, the region completely contains the given cell.
    boolean
    S2Polyline.contains(S2Cell cell)
    If this method returns true, the region completely contains the given cell.
    boolean
    S2Region.contains(S2Cell cell)
    If this method returns true, the region completely contains the given cell.
    boolean
    S2RegionIntersection.contains(S2Cell cell)
    Returns true if all the regions fully contain the cell.
    boolean
    S2RegionUnion.contains(S2Cell cell)
    Only returns true if one of the regions fully contains the cell.
    boolean
    S2ShapeIndexRegion.contains(S2Cell target)
    Returns true if 'target' is contained by any single shape.
    S2Cell.getDistance(S2Cell target)
    Returns the distance to the given cell.
    S2Cell.getMaxDistance(S2Cell target)
    Returns the maximum distance from the cell, including interior, to the given target cell.
    void
    S2Polygon.initToSimplifiedInCell(S2Polygon a, S2Cell cell, S1Angle tolerance)
    Initializes this polygon to a polygon that contains fewer vertices and is within tolerance of the polygon a, while ensuring that the vertices on the cell boundary are preserved.
    boolean
    S2Cap.intersects(S2Cell cell, S2Point[] vertices)
    Return true if the cap intersects 'cell', given that the cap vertices have already been checked.
    final boolean
    S2LatLngRectBase.intersects(S2Cell cell)
    Returns true if this rectangle intersects the given cell.
    boolean
    S2Cap.mayIntersect(S2Cell cell)
     
    boolean
    S2Cell.mayIntersect(S2Cell cell)
     
    boolean
    S2CellUnion.mayIntersect(S2Cell cell)
    This is a fast operation (logarithmic in the size of the cell union).
    final boolean
    S2LatLngRectBase.mayIntersect(S2Cell cell)
    This test is cheap but is NOT exact.
    boolean
    S2Loop.mayIntersect(S2Cell target)
    If this method returns false, the region does not intersect the given cell.
    boolean
    S2Point.mayIntersect(S2Cell cell)
     
    boolean
    S2PointRegion.mayIntersect(S2Cell cell)
     
    boolean
    S2Polygon.mayIntersect(S2Cell target)
    If this method returns false, the region does not intersect the given cell.
    boolean
    S2Polyline.mayIntersect(S2Cell cell)
    If this method returns false, the region does not intersect the given cell.
    boolean
    S2Region.mayIntersect(S2Cell cell)
    If this method returns false, the region does not intersect the given cell.
    boolean
    S2RegionIntersection.mayIntersect(S2Cell cell)
    Returns true if the cell may intersect all regions in this collection.
    boolean
    S2RegionUnion.mayIntersect(S2Cell cell)
    Returns true if the cell may intersect any region in this collection.
    boolean
    S2ShapeIndexRegion.mayIntersect(S2Cell target)
    Returns true if any shape intersects "target".
    boolean
    S2Cell.subdivide(S2Cell[] children)
    Returns true if this is not a leaf cell, in which case the array, which must contain at least four non-null cells in indices 0..3, will be set to the four children of this cell in traversal order.
    Constructors in com.google.common.geometry with parameters of type S2Cell
    Modifier
    Constructor
    Description
     
    S2Loop(S2Cell cell)
    Initialize a loop corresponding to the given cell.
     
    Creates an S2Polygon for a given cell.