Jcg.triangulations3D

Class TriangulationDSCell_3<X extends Point_3>

java.lang.Object

Jcg.triangulations3D.TriangulationDSCell_3<X>

All Implemented Interfaces:

java.lang.Comparable

public class TriangulationDSCell_3<X extends Point_3>
extends java.lang.Object
implements java.lang.Comparable

The class used to encode a cell of a triangulation. Each cell stores pointers to its four vertices as well as to its four neighboring cells. The vertices and neighbors are indexed 0, 1, 2 and 3. Neighbor i lies opposite to vertex i. By convention, facet i is the intersection of the cell and of neighbor i, therefore it also lies opposite to vertex i.

Author:

Luca Castelli Aleardi and Steve Oudot

Field Summary

Fields

Modifier and Type	Field and Description
int	tag

Constructor Summary

Constructors

Constructor and Description
TriangulationDSCell_3() creates an empty cell, whose vertices and neighbors need to be specified later.
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.

Method Summary

Modifier and Type	Method and Description
int	compareTo(java.lang.Object o) compares the cell to another cell using a lexicographical order on their sorted vertices (treated as 3D points).
boolean	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	hasNeighbor(TriangulationDSCell_3<X> c) checks whether c is a neighbor of the cell.
boolean	hasVertex(TriangulationDSVertex_3<X> v) checks whether v is a vertex of the cell.
boolean	hasVertex(X x) checks whether x is a the point associated with a vertex of the cell.
int	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.
int	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	index(X x) returns the index of the vertex of the cell associated with x, and throws an Error if x is associated with no vertex of the cell.
TriangulationDSCell_3<X>	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.
void	setNeighbor(int i, TriangulationDSCell_3<X> c) sets the i-th neighbor of the cell to be c (0<=i<4).
void	setVertex(int i, TriangulationDSVertex_3<X> v) sets the i-th vertex of the cell to be v (0<=i<4).
java.lang.String	toString() generates a string listing the corrdinates of the vertices of the cell.
TriangulationDSVertex_3<X>	vertex(int i) returns a pointer to the i-th vertex of the cell (0<=i<4).
Point_3[]	verticesPoints() returns an array containing the geometric points associated with the vertices of the cell

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

tag

public int tag

Constructor Detail

TriangulationDSCell_3

public TriangulationDSCell_3()

creates an empty cell, whose vertices and neighbors need to be specified later.

TriangulationDSCell_3

public 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. Each ci is opposite to vi.

Method Detail

vertex

public TriangulationDSVertex_3<X> vertex(int i)

returns a pointer to the i-th vertex of the cell (0<=i<4).

verticesPoints

public Point_3[] verticesPoints()

returns an array containing the geometric points associated with the vertices of the cell

neighbor

public TriangulationDSCell_3<X> 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.

setVertex

public void setVertex(int i,
                      TriangulationDSVertex_3<X> v)

sets the i-th vertex of the cell to be v (0<=i<4).

setNeighbor

public void setNeighbor(int i,
                        TriangulationDSCell_3<X> c)

sets the i-th neighbor of the cell to be c (0<=i<4).

index

public int 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.

index

public int 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.

hasVertex

public boolean hasVertex(TriangulationDSVertex_3<X> v)

checks whether v is a vertex of the cell.

hasVertex

public boolean hasVertex(X x)

checks whether x is a the point associated with a vertex of the cell.

index

public int index(X x)

returns the index of the vertex of the cell associated with x, and throws an Error if x is associated with no vertex of the cell.

hasNeighbor

public boolean hasNeighbor(TriangulationDSCell_3<X> c)

checks whether c is a neighbor of the cell.

hasGeometricNeighbor

public boolean 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.

toString

public java.lang.String toString()

generates a string listing the corrdinates of the vertices of the cell.

Overrides:

toString in class java.lang.Object

compareTo

public int compareTo(java.lang.Object o)

compares the cell to another cell using a lexicographical order on their sorted vertices (treated as 3D points).

Specified by:

compareTo in interface java.lang.Comparable