Uses of Class
org.jdelaunay.delaunay.geometries.DEdge

Packages that use DEdge

org.jdelaunay.delaunay	Contains all the classes needed to build the mesh.
org.jdelaunay.delaunay.geometries
org.jdelaunay.delaunay.tools

Uses of DEdge in org.jdelaunay.delaunay

Methods in org.jdelaunay.delaunay that return DEdge

DEdge	VerticalList.get(int i) retrieve the element at position i in the list.
DEdge	VerticalList.getLastLowerEd() get the last evaluated lower edge
DEdge	VerticalList.getLastUpperEd() Get the last evaluated upper edge
DEdge	VerticalList.getLowerEdge(DPoint point) Get the edge that is directly lower to the point in the sorted list.
DEdge	VerticalList.getUpperEdge(DPoint point) Search the edge that will be just upper to the point in the sorted list.
DEdge	ConstrainedMesh.insertIfNotEncroached(DPoint pt, DTriangle container, double minLength) Insert pt in container only if it does not create a new encroached edge in the mesh.
DEdge	ConstrainedMesh.insertTriangleCircumCenter(DTriangle tri, boolean revertible, double minLength) Insert the circumcenter of the given triangle in the mesh.
DEdge	VerticalList.remove(int index) Remove the edge at index index in this vertical list.

Methods in org.jdelaunay.delaunay that return types with arguments of type DEdge

List<DEdge>	ConstrainedMesh.getConstraintEdges() Get the list of edges that are used as constraints during the triangulation
List<DEdge>	ConstrainedMesh.getConstraintFromLPVertical(DPoint left) Get the list of constraint edges whose left point is left, vertically sorted.
List<DEdge>	ConstrainedMesh.getConstraintsFromLeftPoint(DPoint left) Get the list of constraint edges whose left point is left.
List<DEdge>	ConstrainedMesh.getEdges() Get the list of edges
List<DEdge>	VerticalList.getVerticallySortedEdges() Get the list of constraints linked to the boundary of the current mesh.
List<DEdge>	ConstrainedMesh.sortEdgesLeft(List<DEdge> inputList) This method will sort the edges using the coordinates of the left point of the edges.

Methods in org.jdelaunay.delaunay with parameters of type DEdge

void	ConstrainedMesh.addConstraintEdge(DEdge e) Add an edge to the list of constraint edges.
void	ConstrainedMesh.addEdge(DEdge e) Add an edge to the list of edges.
int	VerticalList.addEdge(DEdge constraint) Add an edge to the list of constraints that are considered to be linked to the boundary of the current mesh.
int	VerticalComparator.compare(DEdge edge1, DEdge edge2) This comparison method is a vertical sorting test : Sort two edges (edge1 and edge2, indeed), and sort them according to their intersection point with the line l of equation x=abs.
int	ConstrainedMesh.insertEdgeVerticalList(DEdge edge, List<DEdge> edgeList, double abs) This method will insert a new DEdge in a vertically sorted list, as described in sortEdgesVertically.
boolean	ConstrainedMesh.intersectsExistingEdges(DEdge edge) Checks that edge does not intersect the existing edges of the mesh.
boolean	VerticalList.intersectsUpperOrLower(DPoint pRef, DEdge ed) Checks if the edges that are upper and lower than pRef in the list of constraints that are linked to the boundary intersect the edge ed given in parameter.
void	ConstrainedMesh.removeEdge(DEdge e) Remove an DEdge from the list of edges.
void	VerticalList.removeEdge(DEdge constr) Remove an edge in this vertical list.
int	ConstrainedMesh.searchEdge(DEdge edge) Search an edge in the list of edges.
protected int	VerticalList.searchEdge(DEdge edge) Search an edge in the constraints linked to the boundary.

Method parameters in org.jdelaunay.delaunay with type arguments of type DEdge

void	VerticalList.addEdges(List<DEdge> constraints) Add each of the edge in the list given in argument in this vertical list.
int	ConstrainedMesh.insertEdgeVerticalList(DEdge edge, List<DEdge> edgeList, double abs) This method will insert a new DEdge in a vertically sorted list, as described in sortEdgesVertically.
void	ConstrainedMesh.setConstraintEdges(ArrayList<DEdge> constraint) Set the list of edges that are used as constraints during triangulation
void	ConstrainedMesh.setEdges(List<DEdge> inEdges) Set the list of edges
List<DEdge>	ConstrainedMesh.sortEdgesLeft(List<DEdge> inputList) This method will sort the edges using the coordinates of the left point of the edges.
void	ConstrainedMesh.sortEdgesVertically(List<DEdge> edgeList, double abs) This method will sort the edges contained in the ArrayList list by considering their intersection point with the line of equation x=abs, where a is given in parameter.
void	ConstrainedMesh.sortEdgesVertically(List<DEdge> edgeList, DPoint p) This method will vertically sort the edges in edgeList, using the absciss of the point p given in parameter.

Uses of DEdge in org.jdelaunay.delaunay.geometries

Methods in org.jdelaunay.delaunay.geometries that return DEdge

DEdge	DTriangle.getContainingEdge(DPoint pt) Get the edge that contains pt (if any, and the first found if pt is an apex)
DEdge	DTriangle.getEdge(int i) Get the ith edge i must be equal to 0, 1 or 2.
protected DEdge	DTriangle.getEdgeFromPoints(DPoint p1, DPoint p2) Get the edge of the triangle that includes the two point
DEdge[]	DTriangle.getEdges() Return the edges that form this triangle in an array.
DEdge	DTriangle.getLastEdge(DEdge e1, DEdge e2) Get the last edge that form, with e1 and e2, this triangle.
DEdge	DTriangle.getOppositeEdge(DPoint pt) Return the edge that is not linked to pt, or null if pt is not a point of this triangle.

Methods in org.jdelaunay.delaunay.geometries that return types with arguments of type DEdge

List<DEdge>

ConstraintPolygon.getEdges() Get the edges structure.

Methods in org.jdelaunay.delaunay.geometries with parameters of type DEdge

int	DEdge.compareTo(DEdge edge) Realization of Compare.
boolean	ConstraintPolygon.contains(DEdge anEdge)
int	DTriangle.getEdgeIndex(DEdge ed) Get the index of the edge in the triangle.
Element	DEdge.getIntersection(DEdge ed) intersects two edges returns null if there is no intersection
Element	DEdge.getIntersection(DEdge ed, Map<Integer,Integer> weights) Get the intersection, using the weights given in argument to compute the z : we will use the z from the edge with the highest weight.
DEdge	DTriangle.getLastEdge(DEdge e1, DEdge e2) Get the last edge that form, with e1 and e2, this triangle.
DPoint	DTriangle.getOppositePoint(DEdge ed) Get the point of the triangle that does not belong to the edge
boolean	DEdge.haveSamePoint(DEdge anEdge) Check if two edges have the same points.
int	DEdge.intersects(DEdge other) Check if this and other intersect.
boolean	DTriangle.isEdgeOf(DEdge ed) Returns true if ed is equals to one of the edges that form this triangle.
boolean	ConstraintPolygon.isIntersect(DEdge anEdge)
boolean	DTriangle.isTopoOrientedToEdge(DEdge ed) Returns true if the triangle is turned toward the edge ed.
boolean	DTriangle.setEdge(int i, DEdge anEdge) Set the ith edge.
int	DEdge.sortLeftRight(DEdge edge) This method will be used to sort the edges using the following strategy.
int	DEdge.verticalSort(DEdge edge, double abs) Sort two edges (this and edge, indeed), and sort them according to their intersection point with the line l of equation x=abs.

Constructors in org.jdelaunay.delaunay.geometries with parameters of type DEdge

DEdge(DEdge ed)
Generate an edge from another edge.

DTriangle(DEdge e1, DEdge e2, DEdge e3)
Create a new triangle with the three given edges as a basis.

Uses of DEdge in org.jdelaunay.delaunay.tools

Method parameters in org.jdelaunay.delaunay.tools with type arguments of type DEdge

static boolean

Tools.isVerticallySorted(List<DEdge> edgeList, double abs) Check if the list given in argument is vertically sorted or not.