eu.mihosoft.vrl.v3d.Plane Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of jcsg Show documentation
Show all versions of jcsg Show documentation
Java implementation of BSP based CSG (Constructive Solid Geometry)
/**
* Plane.java
*
* Copyright 2014-2014 Michael Hoffer . All rights
* reserved.
*
* 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 Michael Hoffer "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 Michael Hoffer 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.
*
* The views and conclusions contained in the software and documentation are
* those of the authors and should not be interpreted as representing official
* policies, either expressed or implied, of Michael Hoffer
* .
*/
package eu.mihosoft.vrl.v3d;
// # class Plane
import java.util.ArrayList;
import java.util.List;
/**
* Represents a plane in 3D space.
*
* @author Michael Hoffer <[email protected]>
*/
public class Plane {
/**
* EPSILON is the tolerance used by {@link #splitPolygon(eu.mihosoft.vrl.v3d.Polygon, java.util.List, java.util.List, java.util.List, java.util.List)
* } to decide if a point is on the plane.
*/
public static final double EPSILON = 1e-6;
/**
* XY plane.
*/
public static final Plane XY_PLANE = new Plane(Vector3d.Z_ONE, 1);
/**
* XZ plane.
*/
public static final Plane XZ_PLANE = new Plane(Vector3d.Y_ONE, 1);
/**
* YZ plane.
*/
public static final Plane YZ_PLANE = new Plane(Vector3d.X_ONE, 1);
/**
* Normal vector.
*/
public Vector3d normal;
/**
* Distance to origin.
*/
public double dist;
/**
* Constructor. Creates a new plane defined by its normal vector and the
* distance to the origin.
*
* @param normal plane normal
* @param dist distance from origin
*/
public Plane(Vector3d normal, double dist) {
this.normal = normal.normalized();
this.dist = dist;
}
/**
* Creates a plane defined by the the specified points.
*
* @param a first point
* @param b second point
* @param c third point
* @return a plane
*/
public static Plane createFromPoints(Vector3d a, Vector3d b, Vector3d c) {
Vector3d n = b.minus(a).cross(c.minus(a)).normalized();
return new Plane(n, n.dot(a));
}
@Override
public Plane clone() {
return new Plane(normal.clone(), dist);
}
/**
* Flips this plane.
*/
public void flip() {
normal = normal.negated();
dist = -dist;
}
/**
* Splits a {@link Polygon} by this plane if needed. After that it puts the
* polygons or the polygon fragments in the appropriate lists
* ({@code front}, {@code back}). Coplanar polygons go into either
* {@code coplanarFront}, {@code coplanarBack} depending on their
* orientation with respect to this plane. Polygons in front or back of this
* plane go into either {@code front} or {@code back}.
*
* @param polygon polygon to split
* @param coplanarFront "coplanar front" polygons
* @param coplanarBack "coplanar back" polygons
* @param front front polygons
* @param back back polgons
*/
public void splitPolygon(
Polygon polygon,
List coplanarFront,
List coplanarBack,
List front,
List back) {
final int COPLANAR = 0;
final int FRONT = 1;
final int BACK = 2;
final int SPANNING = 3; // == some in the FRONT + some in the BACK
// Classify each point as well as the entire polygon into one of the
// above four classes.
int polygonType = 0;
List types = new ArrayList<>(polygon.vertices.size());
for (int i = 0; i < polygon.vertices.size(); i++) {
double t = this.normal.dot(polygon.vertices.get(i).pos) - this.dist;
int type = (t < -Plane.EPSILON) ? BACK : (t > Plane.EPSILON) ? FRONT : COPLANAR;
polygonType |= type;
types.add(type);
}
//System.out.println("> switching");
// Put the polygon in the correct list, splitting it when necessary.
switch (polygonType) {
case COPLANAR:
//System.out.println(" -> coplanar");
(this.normal.dot(polygon.plane.normal) > 0 ? coplanarFront : coplanarBack).add(polygon);
break;
case FRONT:
//System.out.println(" -> front");
front.add(polygon);
break;
case BACK:
//System.out.println(" -> back");
back.add(polygon);
break;
case SPANNING:
//System.out.println(" -> spanning");
List f = new ArrayList<>();
List b = new ArrayList<>();
for (int i = 0; i < polygon.vertices.size(); i++) {
int j = (i + 1) % polygon.vertices.size();
int ti = types.get(i);
int tj = types.get(j);
Vertex vi = polygon.vertices.get(i);
Vertex vj = polygon.vertices.get(j);
if (ti != BACK) {
f.add(vi);
}
if (ti != FRONT) {
b.add(ti != BACK ? vi.clone() : vi);
}
if ((ti | tj) == SPANNING) {
double t = (this.dist - this.normal.dot(vi.pos))
/ this.normal.dot(vj.pos.minus(vi.pos));
Vertex v = vi.interpolate(vj, t);
f.add(v);
b.add(v.clone());
}
}
if (f.size() >= 3) {
front.add(new Polygon(f, polygon.getStorage()));
}
if (b.size() >= 3) {
back.add(new Polygon(b, polygon.getStorage()));
}
break;
}
}
}