Uses of Class
Jcg.triangulations2D.TriangulationDSFace_2
Packages that use TriangulationDSFace_2
-
Uses of TriangulationDSFace_2 in Jcg.triangulations2D
Classes in Jcg.triangulations2D that implement interfaces with type arguments of type TriangulationDSFace_2Modifier and TypeClassDescriptionclassTriangulationDSFace_2<X extends Point_>The class used to encode a face of a triangulation.Fields in Jcg.triangulations2D declared as TriangulationDSFace_2Modifier and TypeFieldDescriptionprivate TriangulationDSFace_2<X> HalfedgeHandle.c(package private) TriangulationDSFace_2<X> TriangulationDSVertex_2.faceFace incident to the vertexprotected TriangulationDSFace_2<Point_2> Triangulation_2.startingFaceFields in Jcg.triangulations2D with type parameters of type TriangulationDSFace_2Modifier and TypeFieldDescriptionTriangulationDS_2.facesSet of faces of the triangulationprotected ArrayList<TriangulationDSFace_2<X>> TriangulationDSFace_2.neighborsMethods in Jcg.triangulations2D that return TriangulationDSFace_2Modifier and TypeMethodDescriptionTriangulationDS_2.createFace()creates a new face and adds it to the faces container of the triangulation data structure.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.HalfedgeHandle.getFace()returns the face containing the half-edge.TriangulationDSVertex_2.getFace()returns the cell associated with the vertex.Locates point p in the triangulation and returns a triangle containing p.TriangulationDS_2.makeTriangle(X p1, X p2, X p3) creates a triangle with vertices p1, p2, p3.TriangulationDSFace_2.neighbor(int i) returns a pointer to the i-th neighbor of the cell (0invalid input: '<'=iinvalid input: '<'3), which is by definition the one opposite to the i-th vertex of the cell.Methods in Jcg.triangulations2D that return types with arguments of type TriangulationDSFace_2Modifier and TypeMethodDescriptionTriangulation_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).TriangulationDS_2.incidentFaces(TriangulationDSVertex_2<X> v) Returns the collection of all faces incident to vertex v.Methods in Jcg.triangulations2D with parameters of type TriangulationDSFace_2Modifier and TypeMethodDescriptionbooleanTriangulationDS_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.intTriangulationDSFace_2.compareTo(TriangulationDSFace_2<X> f) compares the face to another face using a clockwise order on their verticesTriangulationDS_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.TriangulationDS_2.createVertex(X p, TriangulationDSFace_2<X> f) creates a new vertex in the triangulation, with the given incident triangle.Delaunay_2.dual(TriangulationDSFace_2<Point_2> f) Outputs the Voronoi vertex dual to face f.booleanTriangulationDS_2.hasFace(TriangulationDSFace_2<X> c) checks whether the triangulation contains face c.booleanTriangulationDSFace_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.booleanTriangulationDSFace_2.hasNeighbor(TriangulationDSFace_2<X> c) checks whether c is a neighbor of the face.intTriangulationDSFace_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.voidTriangulationDS_2.insertBarycenter(TriangulationDSFace_2<X> f) insert in a triangle the barycenter point of its incident verticesTriangulationDS_2.insertInTriangle(X p, TriangulationDSFace_2<X> t) Inserts point p in face c.TriangulationDS_2.insertOutside(X point, TriangulationDSFace_2<X> c, int i) Inserts point p outside the triangulation.booleanTriangulation_2.isInfinite(TriangulationDSFace_2<Point_2> f) Returns true if Face f is infinite, i.e.voidTriangulationDSVertex_2.setFace(TriangulationDSFace_2<X> c) sets the face associated with the vertex.voidTriangulationDSFace_2.setNeighbor(int i, TriangulationDSFace_2<X> c) sets the i-th neighbor of the cell to be c (0invalid input: '<'=iinvalid input: '<'3).Constructors in Jcg.triangulations2D with parameters of type TriangulationDSFace_2ModifierConstructorDescriptionHalfedgeHandle(TriangulationDSFace_2<X> c, int i) TriangulationDSFace_2(TriangulationDSVertex_2<X> v0, TriangulationDSVertex_2<X> v1, TriangulationDSVertex_2<X> v2, TriangulationDSFace_2<X> c0, TriangulationDSFace_2<X> c1, TriangulationDSFace_2<X> c2) creates a face with vertices v0 through v2 and with neighbors c0 through c2.TriangulationDSVertex_2(TriangulationDSFace_2<X> c, X point) creates a vertex with an associated geometric point and an associated cell.