Uses of Class
Jcg.triangulations3D.TriangulationDSCell_3

Packages that use TriangulationDSCell_3

Package	Description
Jcg.triangulations3D
Jcg.viewer.j3d

Uses of TriangulationDSCell_3 in Jcg.triangulations3D

Fields in Jcg.triangulations3D with type parameters of type TriangulationDSCell_3

Modifier and Type	Field and Description
java.util.ArrayList<TriangulationDSCell_3<X>>	TriangulationDS_3.cells

Methods in Jcg.triangulations3D that return TriangulationDSCell_3

Modifier and Type	Method and Description
TriangulationDSCell_3<X>	FacetHandle.cell() returns a cell containing the facet.
TriangulationDSCell_3<X>	TriangulationDS_3.createCell() creates a new cell and adds it to the cells container of the triangulation data structure.
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>	TriangulationDSVertex_3.getCell() returns the cell associated with the vertex.
TriangulationDSCell_3<Point_3>	Delaunay_3.infiniteCell() returns an infinite cell of the triangulation.
TriangulationDSCell_3<Point_3>	Delaunay_3.locate(Point_3 p) locates point p using a straight-line walk from a random cell.
TriangulationDSCell_3<X>	TriangulationDS_3.makeTetrahedron(X p1, X p2, X p3, X p4) creates a tetrahedron with vertices p1, p2, p3 and p4.
TriangulationDSCell_3<X>	TriangulationDSCell_3.neighbor(int i) returns a pointer to the i-th neighbor of the cell (0<=i<4), which is by definition the one opposite to the i-th vertex of the cell.
TriangulationDSCell_3<Point_3>	Delaunay_3.randomCell() returns a random (possibly infinite) cell of the triangulation, chosen according to uniform distribution over the set of all triangulation cells.
TriangulationDSCell_3<Point_3>	Delaunay_3.randomFiniteCell() returns a random finite cell of the triangulation, chosen according to a uniform distribution over the set of finite triangulation cells.

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

Modifier and Type	Method and Description
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.cells() returns the collection of all cells of the triangulation.
java.util.Set<TriangulationDSCell_3<Point_3>>	Delaunay_3.findConflicts(Point_3 p, TriangulationDSCell_3<Point_3> cstart) Computes the set of cells that are in conflict with p, that is, the cells whose circumspheres have p in their interior.
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.finiteCells() returns the collection of all finite cells of the triangulation.
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.incidentCells(TriangulationDSCell_3<Point_3> c, int i, int j) Returns the collection of all cells incident to edge (c,i,j).
java.util.Collection<TriangulationDSCell_3<Point_3>>	TriangulationDS_3.incidentCells(TriangulationDSCell_3<Point_3> c, int i, int j) Returns the collection of all triangulation cells incident to edge (c,i,j).
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>>	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(TriangulationDSCell_3<Point_3> c, int i, int j) Returns the collection of all finite cells incident to edge (c,i,j).
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).

Methods in Jcg.triangulations3D with parameters of type TriangulationDSCell_3

Modifier and Type	Method and Description
boolean	TriangulationDS_3.areEqual(TriangulationDSCell_3<X> c1, int i1, TriangulationDSCell_3<X> c2, int i2) checks whether a facet is shared by two cells c1 and c2: the function check whether the corresponding vertices appear both in c1 and c2, in the correct order.
boolean	TriangulationDS_3.areEqual(TriangulationDSCell_3<X> c1, int i1, TriangulationDSCell_3<X> c2, int i2) checks whether a facet is shared by two cells c1 and c2: the function check whether the corresponding vertices appear both in c1 and c2, in the correct order.
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.
Point_3	Delaunay_3.dual(TriangulationDSCell_3<Point_3> c) Outputs the Voronoi vertex dual to cell c.
java.util.Set<TriangulationDSCell_3<Point_3>>	Delaunay_3.findConflicts(Point_3 p, TriangulationDSCell_3<Point_3> cstart) Computes the set of cells that are in conflict with p, that is, the cells whose circumspheres have p in their interior.
boolean	TriangulationDS_3.hasCell(TriangulationDSCell_3<X> c) checks whether the triangulation contains cell c.
boolean	TriangulationDSCell_3.hasGeometricNeighbor(TriangulationDSCell_3<X> c) checks whether c is geometrically a neighbor of the cell, that is, whether the two tetrahedra share a common 2-face.
boolean	TriangulationDSCell_3.hasNeighbor(TriangulationDSCell_3<X> c) checks whether c is a neighbor of the cell.
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.incidentCells(TriangulationDSCell_3<Point_3> c, int i, int j) Returns the collection of all cells incident to edge (c,i,j).
java.util.Collection<TriangulationDSCell_3<Point_3>>	TriangulationDS_3.incidentCells(TriangulationDSCell_3<Point_3> c, int i, int j) Returns the collection of all triangulation cells incident to edge (c,i,j).
java.util.Collection<TriangulationDSCell_3<Point_3>>	Delaunay_3.incidentFiniteCells(TriangulationDSCell_3<Point_3> c, int i, int j) Returns the collection of all finite cells incident to edge (c,i,j).
int	TriangulationDSCell_3.index(TriangulationDSCell_3<X> c) returns the index of the neighboring cell c, and throws an Error if c is no neighbor of the cell.
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.
boolean	Delaunay_3.isInfinite(TriangulationDSCell_3 c) returns the status of a triangulation cell: infinite if it is incident to at least one infinite vertex, and finite otherwise.
void	TriangulationDSVertex_3.setCell(TriangulationDSCell_3<X> c) sets the cell associated with the vertex.
void	TriangulationDSCell_3.setNeighbor(int i, TriangulationDSCell_3<X> c) sets the i-th neighbor of the cell to be c (0<=i<4).

Method parameters in Jcg.triangulations3D with type arguments of type TriangulationDSCell_3

Modifier and Type	Method and Description
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 TriangulationDSCell_3

Constructor and Description
FacetHandle(TriangulationDSCell_3<X> c, int i)
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.
TriangulationDSVertex_3(TriangulationDSCell_3<X> c, X point) creates a vertex with an associated geometric point and an associated cell.

Uses of TriangulationDSCell_3 in Jcg.viewer.j3d

Fields in Jcg.viewer.j3d with type parameters of type TriangulationDSCell_3

Modifier and Type	Field and Description
java.util.Collection<TriangulationDSCell_3<Point_3>>	MeshViewer.cellsCollection A field in which to store collections of 3D triangulation cells to be shown in the scene.

Method parameters in Jcg.viewer.j3d with type arguments of type TriangulationDSCell_3

Modifier and Type	Method and Description
void	MeshViewer.add3DCells(javax.media.j3d.TransformGroup objTrans, javax.media.j3d.Appearance ap, java.util.Collection<TriangulationDSCell_3<Point_3>> cells, java.awt.Color[] color) Draw a 3D volume mesh (a set of tetrahedra in R3)