Package gov.nih.mipav.model.structures

Class ComputationalGeometry.IterativeHullAlgorithm3D

java.lang.Object

gov.nih.mipav.model.structures.ComputationalGeometry.IterativeHullAlgorithm3D

Enclosing class:

ComputationalGeometry

public class ComputationalGeometry.IterativeHullAlgorithm3D
extends java.lang.Object

Constructor Summary

Constructors

Constructor	Description
IterativeHullAlgorithm3D()

Method Summary

Modifier and Type	Method	Description
void	BuildFirstTetrahedron(java.util.HashSet<ComputationalGeometry.MyVector3> points, ComputationalGeometry.HalfEdgeData3 convexHull)
private ComputationalGeometry.Edge3	FindEdgeFurthestApart(java.util.HashSet<ComputationalGeometry.MyVector3> pointsHashSet)
private ComputationalGeometry.MyVector3	FindPointFurthestAwayFromPlane(java.util.HashSet<ComputationalGeometry.MyVector3> points, ComputationalGeometry.Plane3 plane)
private ComputationalGeometry.MyVector3	FindPointFurthestFromEdge(ComputationalGeometry.Edge3 edge, java.util.HashSet<ComputationalGeometry.MyVector3> pointsHashSet)
private ComputationalGeometry.HalfEdgeFace3	FindVisibleTriangleFromPoint(ComputationalGeometry.MyVector3 p, java.util.HashSet<ComputationalGeometry.HalfEdgeFace3> triangles)
void	FindVisibleTrianglesAndBorderEdgesFromPoint(ComputationalGeometry.MyVector3 p, ComputationalGeometry.HalfEdgeData3 convexHull, java.util.HashSet<ComputationalGeometry.HalfEdgeFace3> visibleTriangles, java.util.HashSet<ComputationalGeometry.HalfEdge3> borderEdges)
ComputationalGeometry.HalfEdgeData3	GenerateConvexHull(java.util.HashSet<ComputationalGeometry.MyVector3> points, boolean removeUnwantedTriangles, ComputationalGeometry.Normalizer3 normalizer)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

IterativeHullAlgorithm3D

public IterativeHullAlgorithm3D()

Method Detail

GenerateConvexHull

public ComputationalGeometry.HalfEdgeData3 GenerateConvexHull(java.util.HashSet<ComputationalGeometry.MyVector3> points,
                                                              boolean removeUnwantedTriangles,
                                                              ComputationalGeometry.Normalizer3 normalizer)

FindVisibleTrianglesAndBorderEdgesFromPoint

public void FindVisibleTrianglesAndBorderEdgesFromPoint(ComputationalGeometry.MyVector3 p,
                                                        ComputationalGeometry.HalfEdgeData3 convexHull,
                                                        java.util.HashSet<ComputationalGeometry.HalfEdgeFace3> visibleTriangles,
                                                        java.util.HashSet<ComputationalGeometry.HalfEdge3> borderEdges)

FindVisibleTriangleFromPoint

private ComputationalGeometry.HalfEdgeFace3 FindVisibleTriangleFromPoint(ComputationalGeometry.MyVector3 p,
                                                                         java.util.HashSet<ComputationalGeometry.HalfEdgeFace3> triangles)

BuildFirstTetrahedron

public void BuildFirstTetrahedron(java.util.HashSet<ComputationalGeometry.MyVector3> points,
                                  ComputationalGeometry.HalfEdgeData3 convexHull)

FindPointFurthestAwayFromPlane

private ComputationalGeometry.MyVector3 FindPointFurthestAwayFromPlane(java.util.HashSet<ComputationalGeometry.MyVector3> points,
                                                                       ComputationalGeometry.Plane3 plane)

FindEdgeFurthestApart

private ComputationalGeometry.Edge3 FindEdgeFurthestApart(java.util.HashSet<ComputationalGeometry.MyVector3> pointsHashSet)

FindPointFurthestFromEdge

private ComputationalGeometry.MyVector3 FindPointFurthestFromEdge(ComputationalGeometry.Edge3 edge,
                                                                  java.util.HashSet<ComputationalGeometry.MyVector3> pointsHashSet)