Package | Description |
---|---|
Jcg.triangulations2D |
Modifier and Type | Field and Description |
---|---|
java.util.ArrayList<TriangulationDSVertex_2<X>> |
TriangulationDS_2.vertices |
Modifier and Type | Method and Description |
---|---|
TriangulationDSVertex_2<X> |
TriangulationDS_2.createVertex(X p,
TriangulationDSFace_2<X> f)
creates a new vertex in the triangulation,
with the given incident triangle.
|
TriangulationDSVertex_2<X> |
HalfedgeHandle.getVertex()
returns the (destination) vertex incident the edge.
|
TriangulationDSVertex_2<X> |
HalfedgeHandle.getVertex(int index)
returns the vertex of prescribed index in the edge: 0 for origin, 1 for destination
|
TriangulationDSVertex_2<Point_2> |
Triangulation_2.insert(Point_2 p)
Inserts point p in the triangulation and returns the newly created vertex
|
TriangulationDSVertex_2<Point_2> |
Delaunay_2.insert(Point_2 p)
Inserts point p in the Delaunay triangulation and returns the newly created vertex
|
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.
|
TriangulationDSVertex_2<X> |
TriangulationDSFace_2.vertex(int i)
returns a pointer to the i-th vertex of the triangle (0<=i<3).
|
Modifier and Type | Method and Description |
---|---|
java.util.Collection<TriangulationDSVertex_2<Point_2>> |
Triangulation_2.finiteVertices()
Computes and returns the collection of all finite vertices of the triangulation
(that is, vertices lying in the interior of the bounding box).
|
Modifier and Type | Method and Description |
---|---|
int |
TriangulationDSVertex_2.compareTo(TriangulationDSVertex_2<X> v) |
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.
|
boolean |
HalfedgeHandle.hasVertex(TriangulationDSVertex_2<X> v)
returns whether the current edge has v as vertex.
|
boolean |
TriangulationDS_2.hasVertex(TriangulationDSVertex_2<X> v)
checks whether the triangulation contains vertex v.
|
boolean |
TriangulationDSFace_2.hasVertex(TriangulationDSVertex_2<X> v)
checks whether v is a vertex of the cell.
|
java.util.Collection<TriangulationDSFace_2<X>> |
TriangulationDS_2.incidentFaces(TriangulationDSVertex_2<X> v)
Returns the collection of all faces incident to vertex v.
|
int |
HalfedgeHandle.index(TriangulationDSVertex_2<X> v)
returns the index of v in the current edge.
|
int |
TriangulationDSFace_2.index(TriangulationDSVertex_2<X> v)
returns the index of vertex v in the cell, and throws an Error if v is no vertex of the cell.
|
boolean |
Triangulation_2.isInfinite(TriangulationDSVertex_2<Point_2> v)
Returns true if Vertex v is infinite, i.e.
|
void |
TriangulationDSFace_2.setVertex(int i,
TriangulationDSVertex_2<X> v)
sets the i-th vertex of the cell to be v (0<=i<3).
|
Constructor and Description |
---|
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.
|
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.
|
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.
|