scalismo.utils
Members list
Type members
Classlikes
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- ArrayUtils.type
Utilility class to quickly determine how long certain operations take. Example: val i = calculate(something) becomes val i = benchmark(calculate(something))
Utilility class to quickly determine how long certain operations take. Example: val i = calculate(something) becomes val i = benchmark(calculate(something))
Available to call statically (Benchmark.benchmark) or as a mixin trait, for convenience.
Attributes
Attributes
- Companion:
- object
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
- object _2DCanConvertToVtk$.typeobject _3DCanConvertToVtk$.type
Attributes
- Companion:
- trait
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- CanConvertToVtk.type
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- CommonConversions.type
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- ImageConversion.type
Attributes
- Companion:
- object
- Graph
- Supertypes
- trait T => Rclass Objecttrait Matchableclass Any
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- MeshConversion.type
represents a metric to be used with the Vantage Point tree
represents a metric to be used with the Vantage Point tree
Attributes
- Companion:
- object
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
Attributes
- Companion:
- object
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
Attributes
- Companion:
- object
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
Recursive, immutable Vantage Point tree Partitions metric spaces for efficient neighbour searches Key concept: split a point set at a node into an inner and an outer set which satisfy:
Recursive, immutable Vantage Point tree Partitions metric spaces for efficient neighbour searches Key concept: split a point set at a node into an inner and an outer set which satisfy:
- inner: all points are closer to the pivot/center than the radius
- outer: all points are further away from the the pivot than radius
WARNING: the tree only works with a metric (positive, symmetric, triangle inequality)
Attributes
- Companion:
- object
- Graph
- Supertypes
- trait Iterable[A]trait IterableFactoryDefaults[A, Iterable]trait IterableOps[A, Iterable, Iterable[A]]trait IterableOnceOps[A, Iterable, Iterable[A]]trait IterableOnce[A]class Objecttrait Matchableclass Any
Attributes
- Companion:
- trait
- Graph
- Supertypes
- trait Sumtrait Mirrorclass Objecttrait Matchableclass Any
- Self type
- VantagePointTree.type
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- VtkHelpers.type