Modifier and Type | Method and Description |
---|---|
Point[] |
DelaunayTriangulation.calcVoronoiCell(Triangle triangle,
Point p)
Calculates a Voronoi cell for a given neighborhood in this triangulation.
|
Point |
Circle.center()
Gets the center of the circle.
|
Point |
DelaunayTriangulation.findClosePoint(Point pointToDelete)
return a point from the trangulation that is close to pointToDelete
|
Point |
Triangle.getA()
returns the first vertex of this triangle.
|
Point |
Triangle.getB()
returns the second vertex of this triangle.
|
Point |
Triangle.getC()
returns the 3th vertex of this triangle.
|
Point |
BoundingBox.getMaxPoint() |
Point |
BoundingBox.getMinPoint() |
Point |
Triangle.getZ(Point q)
compute the Z value for the X,Y values of q. assume this triangle
represent a plane --> q does NOT need to be contained in this triangle.
|
Point |
DelaunayTriangulation.maxBoundingBox()
return the max point of the bounding box of this triangulation
{{x1,y1,z1}}
|
Point |
DelaunayTriangulation.minBoundingBox()
return the min point of the bounding box of this triangulation
{{x0,y0,z0}}
|
Point |
DelaunayTriangulation.z(Point q) |
Modifier and Type | Method and Description |
---|---|
Iterator<Point> |
DelaunayTriangulation.getConvexHullVerticesIterator()
returns an iterator to the set of all the points on the XY-convex hull
|
static List<Point> |
IOParsers.readPoints(File file)
creates a Delaunay Triangulation from all the points in the suggested
tsin file or from a smf file (off like). if the file name is .smf - read
it as an smf file as try to read it as .tsin
Note: duplicated points are ignored! |
static List<Point> |
IOParsers.readPoints(InputStream is) |
static List<Point> |
IOParsers.readPoints(String file) |
Iterator<Point> |
DelaunayTriangulation.verticesIterator()
returns an iterator to the set of points compusing this triangulation.
|
Modifier and Type | Method and Description |
---|---|
Point[] |
DelaunayTriangulation.calcVoronoiCell(Triangle triangle,
Point p)
Calculates a Voronoi cell for a given neighborhood in this triangulation.
|
int |
Point.compareTo(Point o) |
boolean |
Triangle.contains(Point p)
determinates if this triangle contains the point p.
|
boolean |
DelaunayTriangulation.contains(Point p) |
boolean |
Triangle.containsBoundaryIsOutside(Point p)
determinates if this triangle contains the point p.
|
void |
DelaunayTriangulation.deletePoint(Point pointToDelete)
Deletes the given point from this.
|
double |
Point.distance(Point p) |
double |
Point.distance3D(Point p) |
boolean |
Triangle.fallInsideCircumcircle(Point[] arrayPoints) |
Triangle |
DelaunayTriangulation.find(Point 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 |
DelaunayTriangulation.find(Point p,
Triangle 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 |
GridIndex.findCellTriangleOf(Point point)
Finds a triangle near the given point
|
Point |
DelaunayTriangulation.findClosePoint(Point pointToDelete)
return a point from the trangulation that is close to pointToDelete
|
Vector<Triangle> |
DelaunayTriangulation.findTriangleNeighborhood(Triangle firstTriangle,
Point point) |
Point |
Triangle.getZ(Point q)
compute the Z value for the X,Y values of q. assume this triangle
represent a plane --> q does NOT need to be contained in this triangle.
|
void |
DelaunayTriangulation.insertPoint(Point p)
insert the point to this Delaunay Triangulation.
|
boolean |
Triangle.isCorner(Point p)
Checks if the given point is a corner of this triangle.
|
int |
Point.pointLineTest(Point a,
Point 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
|
void |
Triangle.setA(Point a) |
void |
Triangle.setB(Point b) |
void |
Triangle.setC(Point c) |
Point |
DelaunayTriangulation.z(Point q) |
double |
Triangle.zValue(Point q)
compute the Z value for the X,Y values of q.
|
Modifier and Type | Method and Description |
---|---|
void |
DelaunayTriangulation.insertPoints(Collection<Point> points) |
Constructor and Description |
---|
BoundingBox(Point lowerLeft,
Point upperRight)
Create a bounding box between lowerLeft and upperRight
|
Circle(Point c,
double r)
Constructor.
|
DelaunayTriangulation(Point[] ps)
creates a Delaunay Triangulation from all the points.
|
Point(Point p)
simple copy constructor
|
Triangle(Point A,
Point B)
creates a half plane using the segment (A,B).
|
Triangle(Point A,
Point B,
Point C)
constructs a triangle form 3 point - store it in counterclockwised order.
|
Constructor and Description |
---|
DelaunayTriangulation(Collection<Point> points) |
Copyright © 2016. All rights reserved.