mgo/mgo.evolution.algorithm/NSGA3Operations/DiscreteUnitSimplex

DiscreteUnitSimplex

object DiscreteUnitSimplex
Companion
class
trait Product
trait Mirror
class Object
trait Matchable
class Any

Type members

Inherited types

type MirroredElemLabels <: Tuple

The names of the product elements

The names of the product elements

Inherited from
Mirror
type MirroredLabel <: String

The name of the type

The name of the type

Inherited from
Mirror

Value members

Concrete methods

def apply(dimension: Int, divisions: Int): DiscreteUnitSimplex

recursive constructor two complementary hypersimplices are sufficient to generate the simplex in the next dimension (brutal algorithm by filtering points - still a polynomial upper bound)

recursive constructor two complementary hypersimplices are sufficient to generate the simplex in the next dimension (brutal algorithm by filtering points - still a polynomial upper bound)

Value Params
dimension

dimension

divisions

number of divisions

def twoDimSimplex(divisions: Int): DiscreteUnitSimplex

basic case : two dimensional simplex

basic case : two dimensional simplex

Value Params
divisions

divisions