Examples of ca.eandb.jmist.math.Interval.maximum()

ca.eandb.jmist.math.Interval.maximum()
Gets the upper bound of this interval. @return The upper bound of this interval.

        if (!recorder.needAllIntersections()) {
          break;
        }
      }
      ray = ray.advance(x.getDistance());
      I = new Interval(0, I.maximum() - x.getDistance());
    } while (true);


  }


  /* (non-Javadoc)

View Full Code Here

        if (!recorder.needAllIntersections()) {
          break;
        }
      }
      ray = ray.advance(x.getDistance());
      I = new Interval(0, I.maximum() - x.getDistance());
    } while (true);


  }


}

View Full Code Here

        ry += t * d.y();
        rz = (d.z() > 0.0) ? 0.0 : dz;
        nextCell = new Cell(cell.cx, cell.cy, cell.cz + (d.z() > 0.0 ? 1 : -1));
      }


      cellI = new Interval(cellI.maximum(), cellI.maximum() + t);


      if (cellI.maximum() > I.maximum()) {
        cellI = cellI.intersect(I);
        visitor.visit(ray, cellI, cell);
        break;

View Full Code Here

        ry += t * d.y();
        rz = (d.z() > 0.0) ? 0.0 : dz;
        nextCell = new Cell(cell.cx, cell.cy, cell.cz + (d.z() > 0.0 ? 1 : -1));
      }


      cellI = new Interval(cellI.maximum(), cellI.maximum() + t);


      if (cellI.maximum() > I.maximum()) {
        cellI = cellI.intersect(I);
        visitor.visit(ray, cellI, cell);
        break;

View Full Code Here

        nextCell = new Cell(cell.cx, cell.cy, cell.cz + (d.z() > 0.0 ? 1 : -1));
      }


      cellI = new Interval(cellI.maximum(), cellI.maximum() + t);


      if (cellI.maximum() > I.maximum()) {
        cellI = cellI.intersect(I);
        visitor.visit(ray, cellI, cell);
        break;
      }

View Full Code Here

  @Override
  public void intersect(Ray3 ray, IntersectionRecorder recorder) {
    ensureReady();
    Interval I = boundingBox.intersect(ray).intersect(recorder.interval());
    if (!I.isEmpty()) {
      intersectNode(root, I.minimum(), I.maximum(), ray, recorder);
    }
  }


  private void intersectNode(int node, double near, double far, Ray3 ray,
      IntersectionRecorder recorder) {

View Full Code Here


    Interval I = this.sphere.intersect(ray);


    if (!I.isEmpty()) {
      recorder.record(super.newIntersection(ray, I.minimum(), true));
      recorder.record(super.newIntersection(ray, I.maximum(), false));
    }


  }


  /* (non-Javadoc)

View Full Code Here


    if (I.isEmpty())
      return vt;


    vt.add(I.minimum());
    vt.add(I.maximum());


    for (int i = 0; i < PLANES.length; i++) {
      double t = PLANES[i].intersect(ray);
      if (I.contains(t))
        vt.add(t);

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.