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

Packages that use DPoint

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

Uses of DPoint in org.jdelaunay.delaunay

Methods in org.jdelaunay.delaunay that return DPoint

DPoint	VerticalList.getLastLowerPt() get the last point evaluated to perform the getLowerPoint operation
DPoint	VerticalList.getLastUpperPt() Get the last evaluated upper point
DPoint	ConstrainedMesh.getPoint(double x, double y, double z) Try to retrieve the point (x,y,z) in the points' structure.

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

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.
List<DPoint>	ConstrainedMesh.getPoints() Get the points contained in this mesh

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

void	ConstrainedMesh.addPoint(DPoint point) Add a new point in the list that will be used to perform 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.
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.
void	ConstrainedMesh.insertPointInTriangle(DPoint pt, DTriangle container, double minLength) Insert the point pt in the triangle container.
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.
int	ConstrainedMesh.listContainsPoint(DPoint p) This methods will search the point p in the list.
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	VerticalList.setAbs(DPoint pt) Change the absciss where we want our edges to be sorted.
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.

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

void	ConstrainedMesh.setPoints(List<DPoint> pts) Set the list of points to be used during the triangulation If using this method.

Constructors in org.jdelaunay.delaunay with parameters of type DPoint

VerticalList(DPoint pt)
Public constructor.

Uses of DPoint in org.jdelaunay.delaunay.geometries

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

DPoint	DTriangle.getAlterPoint(DPoint p1, DPoint p2) Get the point of the triangle that is not one of the 2 points given in argument.
DPoint	DEdge.getBarycenter() Get the barycenter of the DEdge.
DPoint	DTriangle.getBarycenter() Get the barycenter of the triangle as a DPoint
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.
DPoint	DEdge.getEndPoint()
DPoint	DTriangle.getLeftMost() Get the leftmost point of this triangle.
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	DTriangle.getOppositePoint(DEdge ed) Get the point of the triangle that does not belong to the edge
DPoint	DTriangle.getPoint(int i) Get the ith point. i must be equal to 0, 1 or 2.
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.
DPoint	DEdge.getPointLeft() Get the point of this edge that is on the left from the other.
DPoint	DEdge.getPointRight() Get the point of this edge that is on the left from the other.
DPoint	DEdge.getStartPoint()
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.
DPoint	DEdge.getUpperPoint() return the point of the edge that have the greatest Z coordinate.

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

List<DPoint>	ConstraintPolygon.getPoints() Get points.
List<DPoint>	DTriangle.getPoints() Get a list of points containing the DPoint that define this triangle.
List<DPoint>	BoundaryBox.getPoints() Get the list of points that define this boundary box.

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

void	BoundaryBox.alterBox(DPoint point) alter box coordinates according to the new point
boolean	DTriangle.belongsTo(DPoint aPoint) Check if the point is an apex of the triangle
protected boolean	DPoint.closedTo(DPoint aPoint, double tolerence) Check if the point is closed to the current point, ie if the distance between this and aPoint is inferior to tolerence.
int	DPoint.compareTo(DPoint p) Compare this and p in two dimensions.
int	DPoint.compareTo2D(DPoint p) Compare this and p in two dimensions.
boolean	ConstraintPolygon.contains(DPoint aPoint) Check if this polygon contain the point given in argument.
boolean	DEdge.contains(DPoint aPoint)
abstract boolean	Element.contains(DPoint aPoint) Check if the point is inside the element
boolean	DPoint.contains(DPoint aPoint) Check if aPoint can be considered as equal to this.
boolean	DTriangle.contains(DPoint aPoint)
boolean	DPoint.equals2D(DPoint y) Check if this==y, considering only the first two coordinates.
DPoint	DTriangle.getAlterPoint(DPoint p1, DPoint p2) Get the point of the triangle that is not one of the 2 points given in argument.
DEdge	DTriangle.getContainingEdge(DPoint pt) Get the edge that contains pt (if any, and the first found if pt is an apex)
DPoint	DTriangle.getCounterSteepestIntersection(DPoint dp) Compute the intersection point according to the vector opposite to the steepest vector.
double	DEdge.getDistance2D(DPoint p) Get the euclidean distance between p and the line defined by this edge.
protected DEdge	DTriangle.getEdgeFromPoints(DPoint p1, DPoint p2) Get the edge of the triangle that includes the two point
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.
double	DTriangle.getMinSquareDistance(DPoint pt) Return the square of the minimal distance between pt and the apex of 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.
DPoint	DTriangle.getSteepestIntersectionPoint(DPoint dPoint) Compute the intersection point according the steepest vector.
double	DEdge.getZOnEdge(DPoint p) Make a linear interpolation for the points that lie on the edge.
int	DTriangle.inCircle(DPoint aPoint) Check if the aPoint is in or on the circumcircle of this triangle.
double	DTriangle.interpolateZ(DPoint aPoint) Get Z value of a specific point in the triangle
int	DEdge.intersects(DPoint p1, DPoint p2) check if two edges intersect
boolean	DTriangle.isCloser(DPoint pt, double threshold) Returns true if the minimal distance between pt and one of the apex is smaller than threshold.
boolean	DEdge.isColinear(DPoint p) check if the point is colinear to the edge
boolean	DEdge.isColinear2D(DPoint p) check if the point is colinear to the edge in the XY plane, ie if it lies on the line defined by this edge.
boolean	DEdge.isEncroachedBy(DPoint pt) Test if this edge is encroached by the given point.
boolean	DEdge.isExtremity(DPoint p) check if the point is one of the extremities of the edge (on the xy-plane)
boolean	DEdge.isInside(DPoint p) check if the point is between the extremities of the edge (on the xy-plane)
boolean	DTriangle.isInside(DPoint aPoint) Check if the point is inside the triangle
boolean	DEdge.isLeft(DPoint p) Check if the point p is on the left
boolean	DTriangle.isOnAnEdge(DPoint pt) Determines if pt lies on one of the edges of this triangle.
boolean	DEdge.isOnEdge(DPoint p) Check if the point p is on edge.
boolean	DEdge.isRight(DPoint p) Check if the point p is on the right
Element	DTriangle.searchPointContainer(DPoint pt) This method recursively search for pt in the mesh.
void	DEdge.setEndPoint(DPoint p) Set edge end point.
void	DEdge.setStartPoint(DPoint p) Set edge start point.
boolean	DTriangle.sharedByTwoEdge(DPoint pt) test if pt is an apex of this triangle.
double	DTriangle.softInterpolateZ(DPoint aPoint) Get Z value of a specific point in the triangle Take into account triangles connected to the edge
double	DPoint.squareDistance(DPoint aPoint) square distance to another point
protected double	DPoint.squareDistance2D(DPoint aPoint) plane square distance to another point

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

DEdge(DPoint start, DPoint end)
Generate an edge from two points.

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

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

Uses of DPoint in org.jdelaunay.delaunay.tools

Methods in org.jdelaunay.delaunay.tools that return DPoint

static DPoint	Tools.computeIntersection(DPoint p1, DPoint v1, DPoint p2, DPoint v2) Calcule le point d'intersection de 2 droites coplanaires
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

Methods in org.jdelaunay.delaunay.tools with parameters of type DPoint

static DPoint	Tools.computeIntersection(DPoint p1, DPoint v1, DPoint p2, DPoint v2) Calcule le point d'intersection de 2 droites coplanaires
static boolean	Tools.isColinear(DPoint v1, DPoint v2) Checks that the vectors resulting from v1 and v2 are colinear.
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