object EuclideanDistance
- Alphabetic
- By Inheritance
- EuclideanDistance
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(rdd: RDD[(SpatialKey, Array[Coordinate])], layoutDefinition: LayoutDefinition): RDD[(SpatialKey, Tile)]
Computes a tiled Euclidean distance raster over a very large, dense point set.
Computes a tiled Euclidean distance raster over a very large, dense point set.
Given a very large, dense point set—on the order of 10s to 100s of millions of points or more—this apply method provides the means to relatively efficiently produce a Euclidean distance raster layer for those points. This operator assumes that there is a layout definition for the space in qustion, and that the input points have been binned according to that layout's mapTransform object.
There are caveats to using this function. The assumption is that the incoming point set is _dense_ relative to the layout. An empty SpatialKey in isolation is not probematic. However, large areas devoid of points which translate to many adjacent spatial keys in the grid which are empty will likely cause problems. Additionally, tiles whose Euclidean distance values are defined by points that are not in the current tile or in one of the 8 neighboring tiles will produce incorrect values. This is particularly true in regions outside the mass of points where the medial axis of the point set intrudes (these will be generated in large interior voids or in areas where the point set boundary has nonconvex pockets).
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()