Uses of Class
Jcg.triangulations3D.TriangulationDSVertex_3

Packages that use TriangulationDSVertex_3

Package	Description
Jcg.triangulations3D

Uses of TriangulationDSVertex_3 in Jcg.triangulations3D

Fields in Jcg.triangulations3D with type parameters of type TriangulationDSVertex_3

Modifier and Type	Field and Description
java.util.ArrayList<TriangulationDSVertex_3<X>>	TriangulationDS_3.vertices

Methods in Jcg.triangulations3D that return TriangulationDSVertex_3

Modifier and Type	Method and Description
TriangulationDSVertex_3<Point_3>	Delaunay_3.infiniteVertex() returns an infinite vertex of the triangulation.
TriangulationDSVertex_3<Point_3>	Delaunay_3.insert(Point_3 p) Inserts point p in the triangulation, using a random cell to locate p then the output of the locate to compute the conflicts zone of p.
TriangulationDSVertex_3<Point_3>	Delaunay_3.insert(Point_3 p, TriangulationDSCell_3<Point_3> cstart) Inserts point p in the triangulation, using cell cstart to initiate the conflicts zone computation.
TriangulationDSVertex_3<X>	TriangulationDS_3.insertInCell(X p, TriangulationDSCell_3<X> c) Inserts point p in cell c.
TriangulationDSVertex_3<X>	TriangulationDS_3.insertOutside(X point, TriangulationDSCell_3<X> c, int i) Inserts point p outside the triangulation.
TriangulationDSVertex_3<Point_3>	Delaunay_3.randomFiniteVertex() returns a random finite vertex of the triangulation, chosen according to a uniform distribution over the set of finite triangulation vertices.
TriangulationDSVertex_3<Point_3>	Delaunay_3.randomVertex() returns a random (possibly infinite) vertex of the triangulation, chosen according to uniform distribution over the set of all triangulation vertices.
TriangulationDSVertex_3<X>	TriangulationDSCell_3.vertex(int i) returns a pointer to the i-th vertex of the cell (0<=i<4).
TriangulationDSVertex_3<X>	FacetHandle.vertex(int index) returns the vertex of prescribed index in the facet.

Methods in Jcg.triangulations3D that return types with arguments of type TriangulationDSVertex_3

Modifier and Type	Method and Description
java.util.Collection<TriangulationDSVertex_3<Point_3>>	Delaunay_3.finiteVertices() returns the collection of all finite vertices of the triangulation.
java.util.Collection<TriangulationDSVertex_3<Point_3>>	Delaunay_3.vertices() returns the collection of all vertices of the triangulation.

Methods in Jcg.triangulations3D with parameters of type TriangulationDSVertex_3

Modifier and Type	Method and Description
TriangulationDSCell_3<X>	TriangulationDS_3.createCell(TriangulationDSVertex_3<X> v1, TriangulationDSVertex_3<X> v2, TriangulationDSVertex_3<X> v3, TriangulationDSVertex_3<X> v4, TriangulationDSCell_3<X> c1, TriangulationDSCell_3<X> c2, TriangulationDSCell_3<X> c3, TriangulationDSCell_3<X> c4) creates a new cell in the triangulation, with the given incident vertices and adjacent cells.
TriangulationDSCell_3<X>	TriangulationDS_3.createCell(TriangulationDSVertex_3<X> v1, TriangulationDSVertex_3<X> v2, TriangulationDSVertex_3<X> v3, TriangulationDSVertex_3<X> v4, TriangulationDSCell_3<X> c1, TriangulationDSCell_3<X> c2, TriangulationDSCell_3<X> c3, TriangulationDSCell_3<X> c4) creates a new cell in the triangulation, with the given incident vertices and adjacent cells.
TriangulationDSCell_3<X>	TriangulationDS_3.createCell(TriangulationDSVertex_3<X> v1, TriangulationDSVertex_3<X> v2, TriangulationDSVertex_3<X> v3, TriangulationDSVertex_3<X> v4, TriangulationDSCell_3<X> c1, TriangulationDSCell_3<X> c2, TriangulationDSCell_3<X> c3, TriangulationDSCell_3<X> c4) creates a new cell in the triangulation, with the given incident vertices and adjacent cells.
TriangulationDSCell_3<X>	TriangulationDS_3.createCell(TriangulationDSVertex_3<X> v1, TriangulationDSVertex_3<X> v2, TriangulationDSVertex_3<X> v3, TriangulationDSVertex_3<X> v4, TriangulationDSCell_3<X> c1, TriangulationDSCell_3<X> c2, TriangulationDSCell_3<X> c3, TriangulationDSCell_3<X> c4) creates a new cell in the triangulation, with the given incident vertices and adjacent cells.
java.util.Collection<Triangle_3>	Delaunay_3.dual(TriangulationDSVertex_3<Point_3> v) Outputs the (triangulated) boundary of the Voronoi region dual to vertex v.
boolean	TriangulationDSCell_3.hasVertex(TriangulationDSVertex_3<X> v) checks whether v is a vertex of the cell.
boolean	FacetHandle.hasVertex(TriangulationDSVertex_3<X> v) returns whether the current facet has v as vertex.
boolean	TriangulationDS_3.hasVertex(TriangulationDSVertex_3<X> v) checks whether the triangulation contains vertex v.
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.incidentCells(TriangulationDSVertex_3<Point_3> v) Outputs the collection of all cells incident to vertex v.
java.util.Collection<TriangulationDSCell_3<Point_3>>	TriangulationDS_3.incidentCells(TriangulationDSVertex_3<Point_3> v) Returns the collection of all triangulation cells incident to vertex v.
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.incidentCells(TriangulationDSVertex_3<Point_3> u, TriangulationDSVertex_3<Point_3> v) Returns the collection of all cells incident to edge (u,v).
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.incidentCells(TriangulationDSVertex_3<Point_3> u, TriangulationDSVertex_3<Point_3> v) Returns the collection of all cells incident to edge (u,v).
java.util.Collection<TriangulationDSCell_3<Point_3>>	TriangulationDS_3.incidentCells(TriangulationDSVertex_3<Point_3> u, TriangulationDSVertex_3<Point_3> v) Returns the collection of all triangulation cells incident to edge (u,v).
java.util.Collection<TriangulationDSCell_3<Point_3>>	TriangulationDS_3.incidentCells(TriangulationDSVertex_3<Point_3> u, TriangulationDSVertex_3<Point_3> v) Returns the collection of all triangulation cells incident to edge (u,v).
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.incidentFiniteCells(TriangulationDSVertex_3<Point_3> v) Outputs the collection of all finite cells incident to vertex v.
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.incidentFiniteCells(TriangulationDSVertex_3<Point_3> u, TriangulationDSVertex_3<Point_3> v) Returns the collection of all finite cells incident to edge (u,v).
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.incidentFiniteCells(TriangulationDSVertex_3<Point_3> u, TriangulationDSVertex_3<Point_3> v) Returns the collection of all finite cells incident to edge (u,v).
int	TriangulationDSCell_3.index(TriangulationDSVertex_3<X> v) returns the index of vertex v in the cell, and throws an Error if v is no vertex of the cell.
int	FacetHandle.index(TriangulationDSVertex_3<X> v) returns the index of v in the current facet.
boolean	Delaunay_3.isInfinite(TriangulationDSVertex_3 v) returns the status of a triangulation vertex: infinite if it is a vertex of the bounding box, finite otherwise.
void	TriangulationDSCell_3.setVertex(int i, TriangulationDSVertex_3<X> v) sets the i-th vertex of the cell to be v (0<=i<4).
void	Delaunay_3.starZone(TriangulationDSVertex_3<Point_3> v, java.util.TreeSet<TriangulationDSCell_3<Point_3>> zone) Triangulates a zone (= facet-connected set of cells) by creating a star of simplices joining vertex v to the triangles on the zone's boundary.

Constructors in Jcg.triangulations3D with parameters of type TriangulationDSVertex_3

Constructor and Description
TriangulationDSCell_3(TriangulationDSVertex_3<X> v0, TriangulationDSVertex_3<X> v1, TriangulationDSVertex_3<X> v2, TriangulationDSVertex_3<X> v3, TriangulationDSCell_3<X> c0, TriangulationDSCell_3<X> c1, TriangulationDSCell_3<X> c2, TriangulationDSCell_3<X> c3) creates a cell with vertices v0 through v3 and with neighbors c0 through c4.
TriangulationDSCell_3(TriangulationDSVertex_3<X> v0, TriangulationDSVertex_3<X> v1, TriangulationDSVertex_3<X> v2, TriangulationDSVertex_3<X> v3, TriangulationDSCell_3<X> c0, TriangulationDSCell_3<X> c1, TriangulationDSCell_3<X> c2, TriangulationDSCell_3<X> c3) creates a cell with vertices v0 through v3 and with neighbors c0 through c4.
TriangulationDSCell_3(TriangulationDSVertex_3<X> v0, TriangulationDSVertex_3<X> v1, TriangulationDSVertex_3<X> v2, TriangulationDSVertex_3<X> v3, TriangulationDSCell_3<X> c0, TriangulationDSCell_3<X> c1, TriangulationDSCell_3<X> c2, TriangulationDSCell_3<X> c3) creates a cell with vertices v0 through v3 and with neighbors c0 through c4.
TriangulationDSCell_3(TriangulationDSVertex_3<X> v0, TriangulationDSVertex_3<X> v1, TriangulationDSVertex_3<X> v2, TriangulationDSVertex_3<X> v3, TriangulationDSCell_3<X> c0, TriangulationDSCell_3<X> c1, TriangulationDSCell_3<X> c2, TriangulationDSCell_3<X> c3) creates a cell with vertices v0 through v3 and with neighbors c0 through c4.