Uses of Class
org.jdelaunay.delaunay.error.DelaunayError

Packages that use DelaunayError

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

Uses of DelaunayError in org.jdelaunay.delaunay

Methods in org.jdelaunay.delaunay that throw DelaunayError

void	ConstrainedMesh.addConstraintEdge(DEdge e) Add an edge to the list of constraint edges.
void	ConstrainedMesh.addPoint(DPoint point) Add a new point in the list that will be used to perform the triangulation.
void	ConstrainedMesh.dataQualification(double epsilon) Ensure points are at least at epsilon from other points NB : points are supposed to be already sorted
void	ConstrainedMesh.forceConstraintIntegrity() This method will force the integrity of the constraints used to compute the delaunay triangulation.
List<DPoint>	ConstrainedMesh.getExtensionPoints() Get the extension points that would be added to the mesh while computing DT or CDT with the current set of points.
DEdge	VerticalList.getLowerEdge(DPoint point) Get the edge that is directly lower to the point in the sorted list.
DPoint	ConstrainedMesh.getPoint(double x, double y, double z) Try to retrieve the point (x,y,z) in the points' structure.
DEdge	VerticalList.getUpperEdge(DPoint point) Search the edge that will be just upper to the point in the sorted 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.
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.
void	ConstrainedMesh.insertPointInTriangle(DPoint pt, DTriangle container, double minLength) Insert the point pt in the triangle container.
DEdge	ConstrainedMesh.insertTriangleCircumCenter(DTriangle tri, boolean revertible, double minLength) Insert the circumcenter of the given triangle in the mesh.
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.processDelaunay() Generate the Delaunay's triangularization with a flip-flap algorithm.
void	ConstrainedMesh.refineMesh(double minLength, InsertionEvaluator ev) Refine the mesh, using the Ruppert's algorithm.
void	ConstrainedMesh.refineTriangles(double minLength, InsertionEvaluator ev) Refine the mesh, using a derivate of the Ruppert algorithm.
void	VerticalList.removeEdgeFromRightPoint(DPoint rightPt) Sort the list to the x-coordinate of rightPt, and remove the edges of the list whose right point is equal to rightPt.
void	ConstrainedMesh.removeFlatTriangles() This operation remove the flat triangles by inserting new points in the mesh, that come from the skeleton of the already computed mesh.
void	VerticalList.setAbs(double abs) Change the absciss where we want our edges to be sorted
void	VerticalList.setAbs(DPoint pt) Change the absciss where we want our edges to be sorted.
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
void	ConstrainedMesh.setPoints(List<DPoint> pts) Set the list of points to be used during the triangulation If using this method.
protected void	VerticalList.sort() This method will sort the list using the abs of the current comparator.
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 DelaunayError in org.jdelaunay.delaunay.geometries

Methods in org.jdelaunay.delaunay.geometries that throw DelaunayError

boolean	ConstraintPolygon.contains(com.vividsolutions.jts.geom.Coordinate coordinate) check if this polygon contain the point given in argument.
abstract boolean	Element.contains(com.vividsolutions.jts.geom.Coordinate c) Check if the coordinate is inside the element
boolean	DTriangle.contains(com.vividsolutions.jts.geom.Coordinate c)
boolean	ConstraintPolygon.contains(DEdge anEdge)
DPoint	DEdge.getBarycenter() Get the barycenter of the DEdge.
DPoint	DTriangle.getBarycenter() Get the barycenter of the triangle as a DPoint
Element	DTriangle.getCircumCenterContainer() Return the triangle of the mesh that contains the center of this DTriangle.
Element	DTriangle.getCircumCenterContainerSafe() Return the triangle of the mesh that contains the center of this DTriangle.
DPoint	DTriangle.getCounterSteepestIntersection(DPoint dp) Compute the intersection point according to the vector opposite to the steepest vector.
DPoint	DEdge.getDirectionVector() Get the direction vector of the associated line.
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.
Element	DEdge.getIntersection(DPoint p1, DPoint p2) intersects two edges returns null if there is no intersection
Element	DEdge.getIntersection(DPoint point1, DPoint point2, boolean useCoordZOfp1p2) intersects two edges returns null if there is no intersection if the two edgse are colinear, returns the minimum intersection point, if such a point exists.
DPoint	DEdge.getMiddle() Get the middle of the segment, in 3 dimensions.
DPoint	DTriangle.getNormalVector() Get the normal vector to this triangle, of length 1.
DPoint	DEdge.getPointFromItsX(double abs) This method retrieves the point that would stand on the line defined by this edge, and whose absciss is abs.
List<DPoint>	ConstraintPolygon.getPoints() Get points.
List<DPoint>	BoundaryBox.getPoints() Get the list of points that define this boundary box.
double	DTriangle.getSlope() Get the slope of this DTriangle.
double	DTriangle.getSlopeAspect() Compute the azimut of the triangle in degrees between north and steeepest vector.
double	DTriangle.getSlopeInDegree() get the slope of this DTriangle, in degrees.
double	DTriangle.getSlopeInPercent() Compute the slope of the triangle in percent
DPoint	DTriangle.getSteepestIntersectionPoint(DPoint dPoint) Compute the intersection point according the steepest vector.
DPoint	DTriangle.getSteepestVector() Get the vector with the highest down slope in the plan associated to this triangle.
int	DEdge.intersects(DEdge other) Check if this and other intersect.
int	DEdge.intersects(DPoint p1, DPoint p2) check if two edges intersect
boolean	DEdge.isEncroached() An edge is said to be encroached in a mesh if : (The edge is a constraint OR an edge of the mesh' boundary) AND there is a point lying in the circle it is the diameter of.
boolean	DEdge.isEncroachedBy(DPoint pt) Test if this edge is encroached by the given point.
boolean	ConstraintPolygon.isIntersect(DEdge anEdge)
boolean	DEdge.isLeftTriangleGoToEdge() Returns true if the triangle connected to the left of the edge is pouring into it.
boolean	DEdge.isRightTriangleGoToEdge() Returns true if the triangle connected to the right of the edge is pouring into it.
boolean	DTriangle.isTopoOrientedToEdge(DEdge ed) Returns true if the triangle is turned toward the edge ed.
void	DTriangle.recomputeCenter() Recompute the center of the circle that joins the ptNb points : the CircumCenter
Element	DTriangle.searchPointContainer(DPoint pt) This method recursively search for pt in the mesh.
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 that throw DelaunayError

ConstraintPolygon(com.vividsolutions.jts.geom.Polygon polygon)
Generate a polygon.

ConstraintPolygon(com.vividsolutions.jts.geom.Polygon polygon, boolean isEmpty)
Generate a polygon.

ConstraintPolygon(com.vividsolutions.jts.geom.Polygon polygon, int property)
Generate a polygon with property.

ConstraintPolygon(com.vividsolutions.jts.geom.Polygon polygon, int property, boolean usePolygonZ)
Generate a polygon with property.

ConstraintPolygon(com.vividsolutions.jts.geom.Polygon polygon, int property, boolean usePolygonZ, boolean isEmpty)
Generate a polygon with property.

DEdge(double x, double y, double z, double u, double v, double w)
Create a new edge given the coordinates of its two extremities

DPoint()
Build a point at the origin

DPoint(com.vividsolutions.jts.geom.Coordinate coord)
Build a point as a copy of jts Coordinates

DPoint(double x, double y, double z)
Build a point at coordinates x, y, z with no type

DPoint(DPoint pt)
Build a point as a copy of another point

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

DTriangle(DPoint p1, DPoint p2, DPoint p3)
Create a new triangle with three input points.

Uses of DelaunayError in org.jdelaunay.delaunay.tools

Methods in org.jdelaunay.delaunay.tools that throw DelaunayError

static DPoint	Tools.computeIntersection(DPoint p1, DPoint v1, DPoint p2, DPoint v2) Calcule le point d'intersection de 2 droites coplanaires
static boolean	Tools.isVerticallySorted(List<DEdge> edgeList, double abs) Check if the list given in argument is vertically sorted or not.
static DPoint	Tools.vectorialDiff(DPoint v1, DPoint v2) Compute the difference between two vectors.
static DPoint	Tools.vectorProduct(DPoint v1, DPoint v2) Compute the vector product from the vectors v1 and v2 represented with DPoint