IterativeCostDistance

This Spark-enabled implementation of the standard cost-distance algorithm mentioned in the "previous work" section of [1] is "heavily inspired" by the MrGeo implementation [2] but does not share any code with it.

1. Tomlin, Dana. "Propagating radial waves of travel cost in a grid." International Journal of Geographical Information Science 24.9 (2010): 1391-1413.

2. https://github.com/ngageoint/mrgeo/blob/0c6ed4a7e66bb0923ec5c570b102862aee9e885e/mrgeo-mapalgebra/mrgeo-mapalgebra-costdistance/src/main/scala/org/mrgeo/mapalgebra/CostDistanceMapOp.scala

Linear Supertypes

AnyRef, Any

Type Members

type Changes = ArrayBuffer[KeyCostPair]
class ChangesAccumulator extends AccumulatorV2[KeyCostPair, Changes]

An accumulator to hold lists of edge changes.
type KeyCostPair = (SpatialKey, Cost)

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[K, V](friction: RDD[(K, V)] with Metadata[TileLayerMetadata[K]], geometries: Seq[Geometry], maxCost: Double = Double.PositiveInfinity)(implicit arg0: (K) ⇒ SpatialKey, arg1: (V) ⇒ Tile): RDD[(K, Tile)] with Metadata[TileLayerMetadata[K]]

Perform the cost-distance computation.
Perform the cost-distance computation.
friction
The friction layer; pixels are in units of "seconds per meter"
geometries
The starting locations from-which to compute the cost of traveling
maxCost
The maximum cost before pruning a path (in units of "seconds")
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val logger: Logger
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
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( ... )

Related Doc: package costdistance

object IterativeCostDistance

Type Members

type Changes = ArrayBuffer[KeyCostPair]

class ChangesAccumulator extends AccumulatorV2[KeyCostPair, Changes]

type KeyCostPair = (SpatialKey, Cost)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply[K, V](friction: RDD[(K, V)] with Metadata[TileLayerMetadata[K]], geometries: Seq[Geometry], maxCost: Double = Double.PositiveInfinity)(implicit arg0: (K) ⇒ SpatialKey, arg1: (V) ⇒ Tile): RDD[(K, Tile)] with Metadata[TileLayerMetadata[K]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val logger: Logger

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

Inherited from AnyRef

Inherited from Any

Ungrouped