# SimpleCostDistance

### Related Doc: package costdistance

#### object SimpleCostDistance

Object housing various functions related to Cost-Distance computations.

Linear Supertypes
AnyRef, Any
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. SimpleCostDistance
2. AnyRef
3. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Value Members

1. #### final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
2. #### final def ##(): Int

Definition Classes
AnyRef → Any
3. #### final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
4. #### def apply(frictionTile: Tile, points: Seq[(Int, Int)], maxCost: Double = Double.PositiveInfinity, resolution: Double = 1): DoubleArrayTile

Generate a cost-distance raster based on a set of starting points and a friction raster.

Generate a cost-distance raster based on a set of starting points and a friction raster. This is an implementation of the standard algorithm cited in the "previous work" section of [1].

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

frictionTile

Friction tile; pixels are interpreted as "second per meter"

points

List of starting points as tuples

maxCost

The maximum cost before pruning a path (in units of "seconds")

resolution

The resolution of the tiles (in units of "meters per pixel")

5. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
6. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
7. #### def compute(frictionTile: Tile, costTile: DoubleArrayTile, maxCost: Double, resolution: Double, q: Q, edgeCallback: EdgeCallback): DoubleArrayTile

Compute a cost tile.

Compute a cost tile.

frictionTile

The friction tile

costTile

The tile that will contain the costs

maxCost

The maximum cost before pruning a path (in units of "seconds")

resolution

The resolution of the tiles (in units of "meters per pixel")

q

A priority queue of Cost objects (a.k.a. candidate paths)

edgeCallback

Called when a pixel on the edge of the tile is updated

8. #### final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
9. #### def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
10. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
11. #### def generateEmptyCostTile(cols: Int, rows: Int): DoubleArrayTile

Generate an empty double-valued array tile of the correct dimensions.

Generate an empty double-valued array tile of the correct dimensions.

cols

The number of cols of the friction tile (and therefore the cost tile)

rows

The number of rows of the frition tile and cost tiles

12. #### def generateEmptyQueue(cols: Int, rows: Int): Q

Generate a Queue suitable for working with a tile of the given dimensions.

Generate a Queue suitable for working with a tile of the given dimensions.

cols

The number of columns of the friction tile

rows

The number of rows of the friction tile

13. #### final def getClass(): Class[_]

Definition Classes
AnyRef → Any
14. #### def hashCode(): Int

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

Definition Classes
Any
16. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
17. #### def nop(cost: Cost): Unit

NOP EdgeCallback

18. #### final def notify(): Unit

Definition Classes
AnyRef
19. #### final def notifyAll(): Unit

Definition Classes
AnyRef
20. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
21. #### def toString(): String

Definition Classes
AnyRef → Any
22. #### final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
23. #### final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
24. #### final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )