Package gov.nih.mipav.model.structures

Class ComputationalGeometry.ConstrainedDelaunaySloan

java.lang.Object

gov.nih.mipav.model.structures.ComputationalGeometry.ConstrainedDelaunaySloan

Enclosing class:

ComputationalGeometry

public class ComputationalGeometry.ConstrainedDelaunaySloan
extends java.lang.Object

Constructor Summary

Constructors

Constructor	Description
ConstrainedDelaunaySloan()

Method Summary

Modifier and Type	Method	Description
private ComputationalGeometry.HalfEdgeData2	AddConstraints(ComputationalGeometry.HalfEdgeData2 triangleData, java.util.ArrayList<ComputationalGeometry.MyVector2> constraints, boolean shouldRemoveTriangles)
private boolean	AreTwoEdgesTheSame(ComputationalGeometry.MyVector2 e1_p1, ComputationalGeometry.MyVector2 e1_p2, ComputationalGeometry.MyVector2 e2_p1, ComputationalGeometry.MyVector2 e2_p2)
private java.util.HashSet<ComputationalGeometry.HalfEdge2>	FindAllConstraintEdges(java.util.ArrayList<ComputationalGeometry.MyVector2> constraints, ComputationalGeometry.HalfEdgeData2 triangleData)
private java.util.PriorityQueue<ComputationalGeometry.HalfEdge2>	FindIntersectingEdges_BruteForce(java.util.HashSet<ComputationalGeometry.HalfEdge2> edges, ComputationalGeometry.MyVector2 c_p1, ComputationalGeometry.MyVector2 c_p2)
private void	FindIntersectingEdges_TriangleWalk(ComputationalGeometry.HalfEdgeData2 triangleData, ComputationalGeometry.MyVector2 c_p1, ComputationalGeometry.MyVector2 c_p2, java.util.ArrayList<ComputationalGeometry.HalfEdge2> intersectingEdges)
java.util.HashSet<ComputationalGeometry.HalfEdgeFace2>	FindTrianglesWithinConstraint(ComputationalGeometry.HalfEdgeData2 triangleData, java.util.ArrayList<ComputationalGeometry.MyVector2> constraints)
ComputationalGeometry.HalfEdgeData2	GenerateTriangulation(java.util.HashSet<ComputationalGeometry.MyVector2> points, java.util.ArrayList<ComputationalGeometry.MyVector2> hull, java.util.HashSet<java.util.ArrayList<ComputationalGeometry.MyVector2>> holes, boolean shouldRemoveTriangles, ComputationalGeometry.HalfEdgeData2 triangleData)
private boolean	IsEdgeCrossingEdge(ComputationalGeometry.MyVector2 e1_p1, ComputationalGeometry.MyVector2 e1_p2, ComputationalGeometry.MyVector2 e2_p1, ComputationalGeometry.MyVector2 e2_p2)
private boolean	IsEdgeInListOfEdges(java.util.HashSet<ComputationalGeometry.HalfEdge2> edges, ComputationalGeometry.MyVector2 p1, ComputationalGeometry.MyVector2 p2)
private java.util.ArrayList<ComputationalGeometry.HalfEdge2>	RemoveIntersectingEdges(ComputationalGeometry.MyVector2 v_i, ComputationalGeometry.MyVector2 v_j, java.util.PriorityQueue<ComputationalGeometry.HalfEdge2> intersectingEdges)
private void	RemoveSuperfluousTriangles(ComputationalGeometry.HalfEdgeData2 triangleData, java.util.ArrayList<ComputationalGeometry.MyVector2> constraints)
private void	RestoreDelaunayTriangulation(ComputationalGeometry.MyVector2 c_p1, ComputationalGeometry.MyVector2 c_p2, java.util.ArrayList<ComputationalGeometry.HalfEdge2> newEdges)

Methods inherited from class java.lang.Object

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

Constructor Detail

ConstrainedDelaunaySloan

public ConstrainedDelaunaySloan()

Method Detail

GenerateTriangulation

public ComputationalGeometry.HalfEdgeData2 GenerateTriangulation(java.util.HashSet<ComputationalGeometry.MyVector2> points,
                                                                 java.util.ArrayList<ComputationalGeometry.MyVector2> hull,
                                                                 java.util.HashSet<java.util.ArrayList<ComputationalGeometry.MyVector2>> holes,
                                                                 boolean shouldRemoveTriangles,
                                                                 ComputationalGeometry.HalfEdgeData2 triangleData)

AddConstraints

private ComputationalGeometry.HalfEdgeData2 AddConstraints(ComputationalGeometry.HalfEdgeData2 triangleData,
                                                           java.util.ArrayList<ComputationalGeometry.MyVector2> constraints,
                                                           boolean shouldRemoveTriangles)

RemoveIntersectingEdges

private java.util.ArrayList<ComputationalGeometry.HalfEdge2> RemoveIntersectingEdges(ComputationalGeometry.MyVector2 v_i,
                                                                                     ComputationalGeometry.MyVector2 v_j,
                                                                                     java.util.PriorityQueue<ComputationalGeometry.HalfEdge2> intersectingEdges)

RestoreDelaunayTriangulation

private void RestoreDelaunayTriangulation(ComputationalGeometry.MyVector2 c_p1,
                                          ComputationalGeometry.MyVector2 c_p2,
                                          java.util.ArrayList<ComputationalGeometry.HalfEdge2> newEdges)

RemoveSuperfluousTriangles

private void RemoveSuperfluousTriangles(ComputationalGeometry.HalfEdgeData2 triangleData,
                                        java.util.ArrayList<ComputationalGeometry.MyVector2> constraints)

FindTrianglesWithinConstraint

public java.util.HashSet<ComputationalGeometry.HalfEdgeFace2> FindTrianglesWithinConstraint(ComputationalGeometry.HalfEdgeData2 triangleData,
                                                                                            java.util.ArrayList<ComputationalGeometry.MyVector2> constraints)

FindAllConstraintEdges

private java.util.HashSet<ComputationalGeometry.HalfEdge2> FindAllConstraintEdges(java.util.ArrayList<ComputationalGeometry.MyVector2> constraints,
                                                                                  ComputationalGeometry.HalfEdgeData2 triangleData)

FindIntersectingEdges_BruteForce

private java.util.PriorityQueue<ComputationalGeometry.HalfEdge2> FindIntersectingEdges_BruteForce(java.util.HashSet<ComputationalGeometry.HalfEdge2> edges,
                                                                                                  ComputationalGeometry.MyVector2 c_p1,
                                                                                                  ComputationalGeometry.MyVector2 c_p2)

FindIntersectingEdges_TriangleWalk

private void FindIntersectingEdges_TriangleWalk(ComputationalGeometry.HalfEdgeData2 triangleData,
                                                ComputationalGeometry.MyVector2 c_p1,
                                                ComputationalGeometry.MyVector2 c_p2,
                                                java.util.ArrayList<ComputationalGeometry.HalfEdge2> intersectingEdges)

AreTwoEdgesTheSame

private boolean AreTwoEdgesTheSame(ComputationalGeometry.MyVector2 e1_p1,
                                   ComputationalGeometry.MyVector2 e1_p2,
                                   ComputationalGeometry.MyVector2 e2_p1,
                                   ComputationalGeometry.MyVector2 e2_p2)

IsEdgeInListOfEdges

private boolean IsEdgeInListOfEdges(java.util.HashSet<ComputationalGeometry.HalfEdge2> edges,
                                    ComputationalGeometry.MyVector2 p1,
                                    ComputationalGeometry.MyVector2 p2)

IsEdgeCrossingEdge

private boolean IsEdgeCrossingEdge(ComputationalGeometry.MyVector2 e1_p1,
                                   ComputationalGeometry.MyVector2 e1_p2,
                                   ComputationalGeometry.MyVector2 e2_p1,
                                   ComputationalGeometry.MyVector2 e2_p2)