MultiPolygon

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(ls: MultiLine): OneDimensionAtLeastOneDimensionIntersectionResult

def &(g: TwoDimensions): TwoDimensionsTwoDimensionsIntersectionResult

def &(l: Line): OneDimensionAtLeastOneDimensionIntersectionResult

def &(p: Point): PointOrNoResult

def &(g: Geometry): TwoDimensionsTwoDimensionsIntersectionResult

def -(ps: MultiPolygon): TwoDimensionsTwoDimensionsDifferenceResult

def -(ls: MultiLine): MultiPolygonXDifferenceResult

def -(ps: MultiPoint): MultiPolygonXDifferenceResult

def -(p: Polygon): TwoDimensionsTwoDimensionsDifferenceResult

def -(l: Line): MultiPolygonXDifferenceResult

def -(p: Point): MultiPolygonXDifferenceResult

final def ==(arg0: Any): Boolean

lazy val area: Double

def as[G <: Geometry](implicit arg0: ClassTag[G]): Option[G]

Attempt to convert this Geometry to the provided type

final def asInstanceOf[T0]: T0

lazy val boundary: MultiLineResult

def buffer(d: Double): TwoDimensionsTwoDimensionsUnionResult

Computes a area containing these geometries and buffered by size d.

def centroid: PointOrNoResult

Calculate centroid of this Geometry

def clone(): AnyRef

def contains(g: Geometry): Boolean

def coveredBy(g: TwoDimensions): Boolean

def covers(g: Geometry): Boolean

def crosses(ps: MultiPoint): Boolean

def crosses(g: OneDimension): Boolean

def difference(ps: MultiPolygon): TwoDimensionsTwoDimensionsDifferenceResult

def difference(ls: MultiLine): MultiPolygonXDifferenceResult

def difference(ps: MultiPoint): MultiPolygonXDifferenceResult

def difference(p: Polygon): TwoDimensionsTwoDimensionsDifferenceResult

def difference(l: Line): MultiPolygonXDifferenceResult

def difference(p: Point): MultiPolygonXDifferenceResult

def difference(): MultiPolygonMultiPolygonDifferenceResult

def disjoint(other: Geometry): Boolean

def distance(other: Geometry): Double

Calculate the distance to another Geometry

def envelope: Extent

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def interiorPoint: PointOrNoResult

def intersection(ls: MultiLine): OneDimensionAtLeastOneDimensionIntersectionResult

def intersection(g: TwoDimensions): TwoDimensionsTwoDimensionsIntersectionResult

def intersection(l: Line): OneDimensionAtLeastOneDimensionIntersectionResult

def intersection(p: Point): PointOrNoResult

def intersection(): MultiPolygonMultiPolygonIntersectionResult

def intersection(g: Geometry): TwoDimensionsTwoDimensionsIntersectionResult

Computes a Result that represents a Geometry made up of the points shared by this Polygon and g.

def intersectionSafe(ls: MultiLine): OneDimensionAtLeastOneDimensionIntersectionResult

def intersectionSafe(g: TwoDimensions): TwoDimensionsTwoDimensionsIntersectionResult

def intersectionSafe(l: Line): OneDimensionAtLeastOneDimensionIntersectionResult

def intersectionSafe(p: Point): PointOrNoResult

def intersectionSafe(g: Geometry): TwoDimensionsTwoDimensionsIntersectionResult

Computes a Result that represents a Geometry made up of the points shared by this Polygon and g.

def intersects(other: Geometry): Boolean

def isEmpty: Boolean

Is this Geometry empty? This is faster than checking manually like:

val mp: MultiPoint = ...
val ps: Array[Point] = mp.points  // `.points` is a lazy val with processing overhead

ps.isEmpty  // possible, but mp.isEmpty is faster

final def isInstanceOf[T0]: Boolean

def isValid: Boolean

Check the validity of this geometry

val jtsGeom: com.vividsolutions.jts.geom.MultiPolygon

Return the wrapped jts Geometry

final def ne(arg0: AnyRef): Boolean

def normalized(): MultiPolygon

Returns a unique representation of the geometry based on standard coordinate ordering.

final def notify(): Unit

final def notifyAll(): Unit

def overlaps(g: TwoDimensions): Boolean

lazy val polygons: Array[Polygon]

Returns the Polygons contained in MultiPolygon.

def symDifference(g: TwoDimensions): TwoDimensionsTwoDimensionsSymDifferenceResult

def symDifference(g: OneDimension): LineMultiPolygonSymDifferenceResult

def symDifference(g: ZeroDimensions): PointMultiPolygonSymDifferenceResult

def symDifference(): MultiPolygonMultiPolygonSymDifferenceResult

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def touches(g: AtLeastOneDimension): Boolean

def union: TwoDimensionsTwoDimensionsSeqUnionResult

def union(ps: MultiPolygon): TwoDimensionsTwoDimensionsSeqUnionResult

def union(ls: MultiLine): LineMultiPolygonUnionResult

def union(ps: MultiPoint): LineMultiPolygonUnionResult

def union(p: Polygon): TwoDimensionsTwoDimensionsSeqUnionResult

def union(l: Line): LineMultiPolygonUnionResult

def union(p: Point): PointMultiPolygonUnionResult

lazy val vertexCount: Int

Get the number of vertices in this geometry

lazy val vertices: Array[Point]

Returns this MulitPolygon's vertices.

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def within(g: TwoDimensions): Boolean

def withinDistance(other: Geometry, dist: Double): Boolean

Determine whether another Geometry is within a given distance

def |(ps: MultiPolygon): TwoDimensionsTwoDimensionsSeqUnionResult

def |(ls: MultiLine): LineMultiPolygonUnionResult

def |(ps: MultiPoint): LineMultiPolygonUnionResult

def |(p: Polygon): TwoDimensionsTwoDimensionsSeqUnionResult

def |(l: Line): LineMultiPolygonUnionResult

def |(p: Point): PointMultiPolygonUnionResult

def safeIntersection(ls: MultiLine): OneDimensionAtLeastOneDimensionIntersectionResult

def safeIntersection(g: TwoDimensions): TwoDimensionsTwoDimensionsIntersectionResult

def safeIntersection(l: Line): OneDimensionAtLeastOneDimensionIntersectionResult

def safeIntersection(p: Point): PointOrNoResult

def safeIntersection(g: Geometry): TwoDimensionsTwoDimensionsIntersectionResult