Uses of Class
org.jzy3d.plot3d.builder.delaunay.jdt.Point_dt

Packages that use Point_dt

org.jzy3d.plot3d.builder.delaunay
org.jzy3d.plot3d.builder.delaunay.jdt

Uses of Point_dt in org.jzy3d.plot3d.builder.delaunay

Methods in org.jzy3d.plot3d.builder.delaunay that return types with arguments of type Point_dt

java.util.Iterator<Point_dt>

Triangulation.verticesIterator() returns an iterator to the set of points compusing this triangulation.

Methods in org.jzy3d.plot3d.builder.delaunay with parameters of type Point_dt

void	Triangulation.insertPoint(Point_dt p) insert the point to this Delaunay Triangulation.

Uses of Point_dt in org.jzy3d.plot3d.builder.delaunay.jdt

Methods in org.jzy3d.plot3d.builder.delaunay.jdt that return Point_dt

Point_dt[]	Delaunay_Triangulation.calcVoronoiCell(Triangle_dt triangle, Point_dt p) Calculates a Voronoi cell for a given neighborhood in this triangulation.
Point_dt	Circle_dt.Center() Gets the center of the circle.
Point_dt	Delaunay_Triangulation.findClosePoint(Point_dt pointToDelete) return a point from the trangulation that is close to pointToDelete
Point_dt	BoundingBox.getMaxPoint()
Point_dt	BoundingBox.getMinPoint()
Point_dt	Delaunay_Triangulation.maxBoundingBox() return the max point of the bounding box of this triangulation {{x1,y1,z1}}
Point_dt	Delaunay_Triangulation.minBoundingBox() return the min point of the bounding box of this triangulation {{x0,y0,z0}}
Point_dt	Triangle_dt.p1() returns the first vertex of this triangle.
Point_dt	Triangle_dt.p2() returns the second vertex of this triangle.
Point_dt	Triangle_dt.p3() returns the 3th vertex of this triangle.
Point_dt	Triangle_dt.z(Point_dt q) compute the Z value for the X,Y values of q.
Point_dt	Delaunay_Triangulation.z(Point_dt q)

Methods in org.jzy3d.plot3d.builder.delaunay.jdt that return types with arguments of type Point_dt

java.util.Iterator<Point_dt>	Delaunay_Triangulation.CH_vertices_Iterator() returns an iterator to the set of all the points on the XY-convex hull
static java.util.Comparator<Point_dt>	Point_dt.getComparator()
static java.util.Comparator<Point_dt>	Point_dt.getComparator(int flag)
java.util.Iterator<Point_dt>	Delaunay_Triangulation.verticesIterator() returns an iterator to the set of points compusing this triangulation.

Methods in org.jzy3d.plot3d.builder.delaunay.jdt with parameters of type Point_dt

Point_dt[]	Delaunay_Triangulation.calcVoronoiCell(Triangle_dt triangle, Point_dt p) Calculates a Voronoi cell for a given neighborhood in this triangulation.
boolean	Triangle_dt.contains_BoundaryIsOutside(Point_dt p) determinates if this triangle contains the point p.
boolean	Triangle_dt.contains(Point_dt p) determinates if this triangle contains the point p.
boolean	Delaunay_Triangulation.contains(Point_dt p)
void	Delaunay_Triangulation.deletePoint(Point_dt pointToDelete) Deletes the given point from this.
double	Point_dt.distance(Point_dt p)
double	Point_dt.distance3D(Point_dt p)
boolean	Point_dt.equals(Point_dt p) return true iff this point [x,y] coordinates are the same as p [x,y] coordinates.
boolean	Triangle_dt.fallInsideCircumcircle(Point_dt[] arrayPoints)
Triangle_dt	Delaunay_Triangulation.find(Point_dt p) finds the triangle the query point falls in, note if out-side of this triangulation a half plane triangle will be returned (see contains), the search has expected time of O(n^0.5), and it starts form a fixed triangle (this.startTriangle),
Triangle_dt	Delaunay_Triangulation.find(Point_dt p, Triangle_dt start) finds the triangle the query point falls in, note if out-side of this triangulation a half plane triangle will be returned (see contains). the search starts from the the start triangle
Triangle_dt	GridIndex.findCellTriangleOf(Point_dt point) Finds a triangle near the given point
Point_dt	Delaunay_Triangulation.findClosePoint(Point_dt pointToDelete) return a point from the trangulation that is close to pointToDelete
java.util.Vector<Triangle_dt>	Delaunay_Triangulation.findTriangleNeighborhood(Triangle_dt firstTriangle, Point_dt point)
void	Delaunay_Triangulation.insertPoint(Point_dt p) insert the point to this Delaunay Triangulation.
boolean	Triangle_dt.isCorner(Point_dt p) Checks if the given point is a corner of this triangle.
int	Point_dt.pointLineTest(Point_dt a, Point_dt b) tests the relation between this point (as a 2D [x,y] point) and a 2D segment a,b (the Z values are ignored), returns one of the following: LEFT, RIGHT, INFRONTOFA, BEHINDB, ONSEGMENT
double	Triangle_dt.z_value(Point_dt q) compute the Z value for the X,Y values of q.
Point_dt	Triangle_dt.z(Point_dt q) compute the Z value for the X,Y values of q.
Point_dt	Delaunay_Triangulation.z(Point_dt q)

Constructors in org.jzy3d.plot3d.builder.delaunay.jdt with parameters of type Point_dt

BoundingBox(Point_dt lowerLeft, Point_dt upperRight)
Create a bounding box between lowerLeft and upperRight

Circle_dt(Point_dt c, double r)
Constructor.

Delaunay_Triangulation(Point_dt[] ps)
creates a Delaunay Triangulation from all the points.

Point_dt(Point_dt p)
simple copy constructor

Triangle_dt(Point_dt A, Point_dt B)
creates a half plane using the segment (A,B).

Triangle_dt(Point_dt A, Point_dt B, Point_dt C)
constructs a triangle form 3 point - store it in counterclockwised order.