protected DBox |
Geost.findForbiddenDomain(GeostObject o,
int currentShape,
int[] point,
Geost.SweepDirection dir,
LexicographicalOrder order) |
DBox |
AllowedArea.isFeasible(Geost.SweepDirection min,
LexicographicalOrder order,
GeostObject o,
int currentShape,
int[] c) |
DBox |
DomainHoles.isFeasible(Geost.SweepDirection min,
LexicographicalOrder order,
GeostObject o,
int currentShape,
int[] c) |
DBox |
ForbiddenArea.isFeasible(Geost.SweepDirection min,
LexicographicalOrder order,
GeostObject o,
int currentShape,
int[] c) |
abstract DBox |
InternalConstraint.isFeasible(Geost.SweepDirection min,
LexicographicalOrder order,
GeostObject o,
int currentShape,
int[] c)
It determines whether the given point is a feasible origin of object o, considering
this constraint only.
|
DBox |
ObstacleObject.isFeasible(Geost.SweepDirection min,
LexicographicalOrder order,
GeostObject o,
int currentShape,
int[] c) |
DBox |
ObstacleObjectFrame.isFeasible(Geost.SweepDirection min,
LexicographicalOrder order,
GeostObject o,
int currentShape,
int[] c) |
protected boolean |
ObstacleObjectFrame.timeOnlyCheck(Geost.SweepDirection min,
LexicographicalOrder order,
GeostObject o,
int currentShape,
int[] c) |