|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectsbrt.kernel.math.geom.proc.CdHarProcess<V>
V
- the variable type.public final class CdHarProcess<V>
This class is used to generate random, uniformly distributed points from the interior of a convex polytope.
Constructor Summary | |
---|---|
CdHarProcess(ConvexPolytope<V> polytope)
Constructs a new random point generator process for the provided polytope. |
Method Summary | |
---|---|
ProgressMonitor |
getProgress()
Returns a progress monitor for this process. |
void |
run(ResultsManager<CdHarComp.Results> resultsManager)
Adds random points to the provided results manager. |
void |
setConstraintTolerance(double tolerance)
Sets the constraint tolerance. |
void |
setIterations(int iterations)
Sets the total number of random points to be added to the provided results manager. |
void |
setMaxObstructedMoves(int maxObstructedMoves)
Sets the maximum number of obstructed moves to allow. |
void |
setMinChordLength(double minChordLength)
Sets the minimum chord length. |
void |
setPoint(java.util.Map<? extends V,java.lang.Double> startPoint)
Sets the initial point. |
void |
setPointsPerPoint(int pointsPerPoint)
Sets the total number of points to generate for each point added to the provided results manager. |
void |
setRandom(java.util.Random random)
Sets the random number generator. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public CdHarProcess(ConvexPolytope<V> polytope)
polytope
- the polytope from which random points will be generated.Method Detail |
---|
public void setPoint(java.util.Map<? extends V,java.lang.Double> startPoint)
startPoint
- variables mapped to their numerical values.
InvalidPointException
- if the provided point does not lie within
the polytope.public void setRandom(java.util.Random random)
random
- the random number generator with which all psuedorandom
numbers are to be produced.public void setConstraintTolerance(double tolerance)
tolerance
- the amount by which constaints can be violated. This
should be a small positive number, like 1E-9 for example.public void setMinChordLength(double minChordLength)
minChordLength
- the minimum length a chord must have to be
considered valid. This should be a small positive number, like 1E-9 for
example.public void setIterations(int iterations)
iterations
- the total number of random points to be added to the
provided results manager.
java.lang.IllegalArgumentException
- if maxObstructedMoves
< 0public void setPointsPerPoint(int pointsPerPoint)
pointsPerPoint
- the total number of points to generate for each
point added to the provided results manager.
java.lang.IllegalArgumentException
- if pointsPerPoint
< 1public void setMaxObstructedMoves(int maxObstructedMoves)
maxObstructedMoves
- the number of obstructed moves to allow.
java.lang.IllegalArgumentException
- if maxObstructedMoves
< 0public ProgressMonitor getProgress()
getProgress
in interface MonitoredProcess<CdHarComp.Results>
public void run(ResultsManager<CdHarComp.Results> resultsManager)
run
in interface KernelProcess<CdHarComp.Results>
resultsManager
- the results manager to which the random points are
added.
java.lang.IllegalStateException
- if any required information was not provided.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |