package com.github.quickhull3d; /* * #%L * A Robust 3D Convex Hull Algorithm in Java * %% * Copyright (C) 2004 - 2014 John E. Lloyd * %% * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. * #L% */ /** * Represents the half-edges that surround each face in a counter-clockwise * direction. * * @author John E. Lloyd, Fall 2004 */ class HalfEdge { /** * The vertex associated with the head of this half-edge. */ protected Vertex vertex; /** * Triangular face associated with this half-edge. */ protected Face face; /** * Next half-edge in the triangle. */ protected HalfEdge next; /** * Previous half-edge in the triangle. */ protected HalfEdge prev; /** * Half-edge associated with the opposite triangle adjacent to this edge. */ protected HalfEdge opposite; /** * Constructs a HalfEdge with head vertex <code>v</code> and left-hand * triangular face <code>f</code>. * * @param v * head vertex * @param f * left-hand triangular face */ public HalfEdge(Vertex v, Face f) { vertex = v; face = f; } public HalfEdge() { } /** * Sets the value of the next edge adjacent (counter-clockwise) to this one * within the triangle. * * @param edge * next adjacent edge */ public void setNext(HalfEdge edge) { next = edge; } /** * Gets the value of the next edge adjacent (counter-clockwise) to this one * within the triangle. * * @return next adjacent edge */ public HalfEdge getNext() { return next; } /** * Sets the value of the previous edge adjacent (clockwise) to this one * within the triangle. * * @param edge * previous adjacent edge */ public void setPrev(HalfEdge edge) { prev = edge; } /** * Gets the value of the previous edge adjacent (clockwise) to this one * within the triangle. * * @return previous adjacent edge */ public HalfEdge getPrev() { return prev; } /** * Returns the triangular face located to the left of this half-edge. * * @return left-hand triangular face */ public Face getFace() { return face; } /** * Returns the half-edge opposite to this half-edge. * * @return opposite half-edge */ public HalfEdge getOpposite() { return opposite; } /** * Sets the half-edge opposite to this half-edge. * * @param edge * opposite half-edge */ public void setOpposite(HalfEdge edge) { opposite = edge; edge.opposite = this; } /** * Returns the head vertex associated with this half-edge. * * @return head vertex */ public Vertex head() { return vertex; } /** * Returns the tail vertex associated with this half-edge. * * @return tail vertex */ public Vertex tail() { return prev != null ? prev.vertex : null; } /** * Returns the opposite triangular face associated with this half-edge. * * @return opposite triangular face */ public Face oppositeFace() { return opposite != null ? opposite.face : null; } /** * Produces a string identifying this half-edge by the point index values of * its tail and head vertices. * * @return identifying string */ public String getVertexString() { if (tail() != null) { return "" + tail().index + "-" + head().index; } return "?-" + head().index; } /** * Returns the length of this half-edge. * * @return half-edge length */ public double length() { if (tail() != null) { return head().pnt.distance(tail().pnt); } return -1; } /** * Returns the length squared of this half-edge. * * @return half-edge length squared */ public double lengthSquared() { if (tail() != null) { return head().pnt.distanceSquared(tail().pnt); } return -1; } // /** // * Computes nrml . (del0 X del1), where del0 and del1 // * are the direction vectors along this halfEdge, and the // * halfEdge he1. // * // * A product > 0 indicates a left turn WRT the normal // */ // public double turnProduct (HalfEdge he1, Vector3d nrml) // { // Point3d pnt0 = tail().pnt; // Point3d pnt1 = head().pnt; // Point3d pnt2 = he1.head().pnt; // double del0x = pnt1.x - pnt0.x; // double del0y = pnt1.y - pnt0.y; // double del0z = pnt1.z - pnt0.z; // double del1x = pnt2.x - pnt1.x; // double del1y = pnt2.y - pnt1.y; // double del1z = pnt2.z - pnt1.z; // return (nrml.x*(del0y*del1z - del0z*del1y) + // nrml.y*(del0z*del1x - del0x*del1z) + // nrml.z*(del0x*del1y - del0y*del1x)); // } }