public class HammersleyPointSet extends PointSet
RadicalInverse.
This class is not a subclass of DigitalNet, because the basis
is not the same for all coordinates.
We do obtain a net in a generalized sense if
n = b1k1 = b2k2 = ... = bs-1ks-1
for some integers
k1,..., ks-1.
The points of a Hammersley point set can be ``scrambled'' by applying a permutation to the digits of i before computing each coordinate. If
| Constructor and Description |
|---|
HammersleyPointSet(int n,
int dim)
Constructs a new Hammersley point set with n points in dim
dimensions.
|
| Modifier and Type | Method and Description |
|---|---|
void |
addFaurePermutations()
Permutes the digits using Faure permutations for all coordinates.
|
void |
ErasePermutations()
Erases the Faure permutations: from now on, the digits will not be
Faure permuted.
|
double |
getCoordinate(int i,
int j)
Returns ui, j, the coordinate j of the point i.
|
addRandomShift, addRandomShift, addRandomShift, addRandomShift, clearRandomShift, formatPoints, formatPoints, formatPoints, formatPoints, formatPointsBase, formatPointsBase, formatPointsBase, formatPointsBase, formatPointsNumbered, formatPointsNumbered, getDimension, getNumPoints, getStream, iterator, randomize, randomize, randomize, randomize, randomize, setStream, toString, unrandomizepublic HammersleyPointSet(int n,
int dim)
n - number of pointsdim - dimension of the point setpublic void addFaurePermutations()
public void ErasePermutations()
public double getCoordinate(int i,
int j)
PointSetgetCoordinate in class PointSeti - index of the point to look forj - index of the coordinate to look forTo submit a bug or ask questions, send an e-mail to Pierre L'Ecuyer.