Geometry

abstract def jtsGeom: com.vividsolutions.jts.geom.Geometry

Return the wrapped jts Geometry

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(g: Geometry): TwoDimensionsTwoDimensionsIntersectionResult

final def ==(arg0: Any): Boolean

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

Attempt to convert this Geometry to the provided type

final def asInstanceOf[T0]: T0

def centroid: PointOrNoResult

Calculate centroid of this Geometry

def clone(): AnyRef

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(g: Geometry): TwoDimensionsTwoDimensionsIntersectionResult

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

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

Determine whether another Geometry is within a given distance

def safeIntersection(g: Geometry): TwoDimensionsTwoDimensionsIntersectionResult