/** Build a region covering the whole space. * @return a region containing the instance (really an {@link * IntervalsSet IntervalsSet} instance) */ public IntervalsSet wholeSpace() { return new IntervalsSet(tolerance); }
/** Build a sub-line covering the whole line. * @return a sub-line covering the whole line */ public SubLine wholeLine() { return new SubLine(this, new IntervalsSet(tolerance)); }
/** {@inheritDoc} */ public SubLine wholeHyperplane() { return new SubLine(this, new IntervalsSet(tolerance)); }
/** {@inheritDoc} */ @Override public IntervalsSet buildNew(final BSPTree<Euclidean1D> tree) { return new IntervalsSet(tree, getTolerance()); }
/** Build an interval set from two points. * @param start start point * @param end end point * @param tolerance tolerance below which points are considered identical * @return an interval set */ private static IntervalsSet buildIntervalSet(final Vector2D start, final Vector2D end, final double tolerance) { final Line line = new Line(start, end, tolerance); return new IntervalsSet(line.toSubSpace((Point<Euclidean2D>) start).getX(), line.toSubSpace((Point<Euclidean2D>) end).getX(), tolerance); }
/** Build an interval set from two points. * @param start start point * @param end end point * @return an interval set * @param tolerance tolerance below which points are considered identical * @exception MathIllegalArgumentException if the points are equal */ private static IntervalsSet buildIntervalSet(final Vector3D start, final Vector3D end, final double tolerance) throws MathIllegalArgumentException { final Line line = new Line(start, end, tolerance); return new IntervalsSet(line.toSubSpace((Point<Euclidean3D>) start).getX(), line.toSubSpace((Point<Euclidean3D>) end).getX(), tolerance); }
final Line line = new Line(previous, current, tolerance); final IntervalsSet region = new IntervalsSet(line.toSubSpace((Point<Euclidean2D>) previous).getX(), line.toSubSpace((Point<Euclidean2D>) current).getX(), tolerance);
new BSPTree<Euclidean1D>(subMinus, new BSPTree<Euclidean1D>(Boolean.FALSE), splitTree.getMinus(), null); return new SplitSubHyperplane<Euclidean2D>(new SubLine(thisLine.copySelf(), new IntervalsSet(plusTree, tolerance)), new SubLine(thisLine.copySelf(), new IntervalsSet(minusTree, tolerance)));
/** Build a region covering the whole space. * @return a region containing the instance (really an {@link * IntervalsSet IntervalsSet} instance) */ public IntervalsSet wholeSpace() { return new IntervalsSet(tolerance); }
/** Build a sub-line covering the whole line. * @return a sub-line covering the whole line */ public SubLine wholeLine() { return new SubLine(this, new IntervalsSet(tolerance)); }
/** {@inheritDoc} */ public SubLine wholeHyperplane() { return new SubLine(this, new IntervalsSet(tolerance)); }
/** {@inheritDoc} */ @Override public IntervalsSet buildNew(final BSPTree<Euclidean1D> tree) { return new IntervalsSet(tree, getTolerance()); }
/** Build an interval set from two points. * @param start start point * @param end end point * @return an interval set * @param tolerance tolerance below which points are considered identical * @exception MathIllegalArgumentException if the points are equal */ private static IntervalsSet buildIntervalSet(final Vector3D start, final Vector3D end, final double tolerance) throws MathIllegalArgumentException { final Line line = new Line(start, end, tolerance); return new IntervalsSet(line.toSubSpace((Point<Euclidean3D>) start).getX(), line.toSubSpace((Point<Euclidean3D>) end).getX(), tolerance); }
/** Build an interval set from two points. * @param start start point * @param end end point * @param tolerance tolerance below which points are considered identical * @return an interval set */ private static IntervalsSet buildIntervalSet(final Vector2D start, final Vector2D end, final double tolerance) { final Line line = new Line(start, end, tolerance); return new IntervalsSet(line.toSubSpace((Point<Euclidean2D>) start).getX(), line.toSubSpace((Point<Euclidean2D>) end).getX(), tolerance); }
final Line line = new Line(previous, current, tolerance); final IntervalsSet region = new IntervalsSet(line.toSubSpace((Point<Euclidean2D>) previous).getX(), line.toSubSpace((Point<Euclidean2D>) current).getX(), tolerance);
new BSPTree<Euclidean1D>(subMinus, new BSPTree<Euclidean1D>(Boolean.FALSE), splitTree.getMinus(), null); return new SplitSubHyperplane<Euclidean2D>(new SubLine(thisLine.copySelf(), new IntervalsSet(plusTree, tolerance)), new SubLine(thisLine.copySelf(), new IntervalsSet(minusTree, tolerance)));