Package | Description |
---|---|
Jcg.triangulations2D |
Modifier and Type | Field and Description |
---|---|
java.util.ArrayList<TriangulationDSFace_2<X>> |
TriangulationDS_2.faces |
Modifier and Type | Method and Description |
---|---|
TriangulationDSFace_2<X> |
TriangulationDS_2.createFace()
creates a new face and adds it to the faces container of the triangulation data structure.
|
TriangulationDSFace_2<X> |
TriangulationDS_2.createFace(TriangulationDSVertex_2<X> v1,
TriangulationDSVertex_2<X> v2,
TriangulationDSVertex_2<X> v3,
TriangulationDSFace_2<X> c1,
TriangulationDSFace_2<X> c2,
TriangulationDSFace_2<X> c3)
creates a new face in the triangulation,
with the given incident vertices and adjacent triangles.
|
TriangulationDSFace_2<X> |
HalfedgeHandle.getFace()
returns the face containing the half-edge.
|
TriangulationDSFace_2<X> |
TriangulationDSVertex_2.getFace()
returns the cell associated with the vertex.
|
TriangulationDSFace_2<Point_2> |
Triangulation_2.locate(Point_2 p)
Locates point p in the triangulation and returns a triangle containing p.
|
TriangulationDSFace_2<X> |
TriangulationDS_2.makeTriangle(X p1,
X p2,
X p3)
creates a triangle with vertices p1, p2, p3.
|
TriangulationDSFace_2<X> |
TriangulationDSFace_2.neighbor(int i)
returns a pointer to the i-th neighbor of the cell (0<=i<3),
which is by definition the one opposite to the i-th vertex of the cell.
|
Modifier and Type | Method and Description |
---|---|
java.util.Collection<TriangulationDSFace_2<Point_2>> |
Triangulation_2.finiteFaces()
Computes and returns the collection of all finite faces of the triangulation
(that is, faces lying in the interior of the bounding box).
|
java.util.Collection<TriangulationDSFace_2<X>> |
TriangulationDS_2.incidentFaces(TriangulationDSVertex_2<X> v)
Returns the collection of all faces incident to vertex v.
|
Modifier and Type | Method and Description |
---|---|
boolean |
TriangulationDS_2.areEqual(TriangulationDSFace_2<X> face1,
int i1,
TriangulationDSFace_2<X> face2,
int i2)
checks whether an edge is shared by two faces f1 and f2:
the function check whether the corresponding vertices
appear both in f1 and f2, in the correct order.
|
boolean |
TriangulationDS_2.areEqual(TriangulationDSFace_2<X> face1,
int i1,
TriangulationDSFace_2<X> face2,
int i2)
checks whether an edge is shared by two faces f1 and f2:
the function check whether the corresponding vertices
appear both in f1 and f2, in the correct order.
|
int |
TriangulationDSFace_2.compareTo(TriangulationDSFace_2<X> f)
compares the face to another face using a clockwise order on their vertices
|
TriangulationDSFace_2<X> |
TriangulationDS_2.createFace(TriangulationDSVertex_2<X> v1,
TriangulationDSVertex_2<X> v2,
TriangulationDSVertex_2<X> v3,
TriangulationDSFace_2<X> c1,
TriangulationDSFace_2<X> c2,
TriangulationDSFace_2<X> c3)
creates a new face in the triangulation,
with the given incident vertices and adjacent triangles.
|
TriangulationDSFace_2<X> |
TriangulationDS_2.createFace(TriangulationDSVertex_2<X> v1,
TriangulationDSVertex_2<X> v2,
TriangulationDSVertex_2<X> v3,
TriangulationDSFace_2<X> c1,
TriangulationDSFace_2<X> c2,
TriangulationDSFace_2<X> c3)
creates a new face in the triangulation,
with the given incident vertices and adjacent triangles.
|
TriangulationDSFace_2<X> |
TriangulationDS_2.createFace(TriangulationDSVertex_2<X> v1,
TriangulationDSVertex_2<X> v2,
TriangulationDSVertex_2<X> v3,
TriangulationDSFace_2<X> c1,
TriangulationDSFace_2<X> c2,
TriangulationDSFace_2<X> c3)
creates a new face in the triangulation,
with the given incident vertices and adjacent triangles.
|
TriangulationDSVertex_2<X> |
TriangulationDS_2.createVertex(X p,
TriangulationDSFace_2<X> f)
creates a new vertex in the triangulation,
with the given incident triangle.
|
Point_2 |
Delaunay_2.dual(TriangulationDSFace_2<Point_2> f)
Outputs the Voronoi vertex dual to face f.
|
boolean |
TriangulationDS_2.hasFace(TriangulationDSFace_2<X> c)
checks whether the triangulation contains face c.
|
boolean |
TriangulationDSFace_2.hasGeometricNeighbor(TriangulationDSFace_2<X> c)
checks whether c is geometrically a neighbor of the face, that is, whether the two triangles
share a common edge.
|
boolean |
TriangulationDSFace_2.hasNeighbor(TriangulationDSFace_2<X> c)
checks whether c is a neighbor of the face.
|
int |
TriangulationDSFace_2.index(TriangulationDSFace_2<X> c)
returns the index of the neighboring face c,
and throws an Error if c is no neighbor of the face.
|
void |
TriangulationDS_2.insertBarycenter(TriangulationDSFace_2<X> f)
insert in a triangle the barycenter point of its incident vertices
|
TriangulationDSVertex_2<X> |
TriangulationDS_2.insertInTriangle(X p,
TriangulationDSFace_2<X> t)
Inserts point p in face c.
|
TriangulationDSVertex_2<X> |
TriangulationDS_2.insertOutside(X point,
TriangulationDSFace_2<X> c,
int i)
Inserts point p outside the triangulation.
|
boolean |
Triangulation_2.isInfinite(TriangulationDSFace_2<Point_2> f)
Returns true if Face f is infinite, i.e.
|
void |
TriangulationDSVertex_2.setFace(TriangulationDSFace_2<X> c)
sets the face associated with the vertex.
|
void |
TriangulationDSFace_2.setNeighbor(int i,
TriangulationDSFace_2<X> c)
sets the i-th neighbor of the cell to be c (0<=i<3).
|