All Downloads are FREE. Search and download functionalities are using the official Maven repository.

edu.mines.jtk.sgl.Segment Maven / Gradle / Ivy

There is a newer version: 1.1.0
Show newest version
/****************************************************************************
Copyright 2004, Colorado School of Mines and others.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
****************************************************************************/
package edu.mines.jtk.sgl;

import static edu.mines.jtk.util.MathPlus.DBL_EPSILON;

/**
 * A segment of a line.
 * @author Dave Hale, Colorado School of Mines
 * @version 2005.07.05
 */
public class Segment {

  /**
   * Constructs a segment with the specified endpoints.
   * @param a the endpoint A.
   * @param b the endpoint B.
   */
  public Segment(Point3 a, Point3 b) {
    _a = new Point3(a);
    _b = new Point3(b);
    _d = _b.minus(_a);
  }

  /**
   * Constructs a copy of the specified segment.
   * @param ls the segment.
   */
  public Segment(Segment ls) {
    this(ls._a,ls._b);
  }

  /**
   * Gets the endpoint A of this segment.
   * @return the endpoint A.
   */
  public Point3 getA() {
    return new Point3(_a);
  }

  /**
   * Gets the endpoint B of this segment.
   * @return the endpoint B.
   */
  public Point3 getB() {
    return new Point3(_b);
  }

  /**
   * Returns the length of this segment.
   * @return the length.
   */
  public double length() {
    return _a.distanceTo(_b);
  }

  /**
   * Transforms this segment, given the specified transform matrix.
   * @param m the transform matrix.
   */
  public void transform(Matrix44 m) {
    _a = m.times(_a);
    _b = m.times(_b);
    _d = _b.minus(_a);
  }

  /**
   * Tests this segment for intersection with the specified triangle. If 
   * such an intersection exists, this method returns the intersection point.
   * @param xa x coordinate of triangle vertex a.
   * @param ya y coordinate of triangle vertex a.
   * @param za z coordinate of triangle vertex a.
   * @param xb x coordinate of triangle vertex b.
   * @param yb y coordinate of triangle vertex b.
   * @param zb z coordinate of triangle vertex b.
   * @param xc x coordinate of triangle vertex c.
   * @param yc y coordinate of triangle vertex c.
   * @param zc z coordinate of triangle vertex c.
   * @return the point of intersection; null, if none.
   */
  public Point3 intersectWithTriangle(
    double xa, double ya, double za,
    double xb, double yb, double zb,
    double xc, double yc, double zc)
  {
    double xd = _d.x;
    double yd = _d.y;
    double zd = _d.z;
    double xba = xb-xa;
    double yba = yb-ya;
    double zba = zb-za;
    double xca = xc-xa;
    double yca = yc-ya;
    double zca = zc-za;
    double xp = yd*zca-zd*yca;
    double yp = zd*xca-xd*zca;
    double zp = xd*yca-yd*xca;
    double a = xba*xp+yba*yp+zba*zp;
    if (-TINY1.0)
      return null;
    double xq = yaa*zba-zaa*yba;
    double yq = zaa*xba-xaa*zba;
    double zq = xaa*yba-yaa*xba;
    double v = f*(xd*xq+yd*yq+zd*zq);
    if (v<0.0 || u+v>1.0)
      return null;
    double t = f*(xca*xq+yca*yq+zca*zq);
    if (t<0.0 || 1.0




© 2015 - 2024 Weber Informatics LLC | Privacy Policy