Jcg.triangulations3D

Class TriangulationDS_3<X extends Point_3>

java.lang.Object

Jcg.triangulations3D.TriangulationDS_3<X>

public class TriangulationDS_3<X extends Point_3>
extends java.lang.Object

Data structure for representing 3D triangulations that uses the standard cell/vertex encoding, represented by classes TriangulationDSCell_3 and TriangulationDSVertex_3 respectively. In this representation we store the collection of 3D cells as well as the collection of vertices of the triangulation. Each cell provides access to its vertices and neighboring cells, while each vertex provides access to one of its incident cells.

Author:

Luca Castelli Aleardi and Steve Oudot

Field Summary

Fields

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

Constructor Summary

Constructors

Constructor and Description
TriangulationDS_3() creates an empty triangulation data structure.
TriangulationDS_3(int nCells, int nVertices) creates an empty triangulation data structure with prescribed numbers of cells and vertices.

Method Summary

Modifier and Type	Method and Description
boolean	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>	createCell() creates a new cell and adds it to the cells container of the triangulation data structure.
TriangulationDSCell_3<X>	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.
boolean	hasCell(TriangulationDSCell_3<X> c) checks whether the triangulation contains cell c.
boolean	hasVertex(TriangulationDSVertex_3<X> v) checks whether the triangulation contains vertex v.
java.util.Collection<TriangulationDSCell_3<Point_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>>	incidentCells(TriangulationDSVertex_3<Point_3> v) Returns the collection of all triangulation cells incident to vertex v.
java.util.Collection<TriangulationDSCell_3<Point_3>>	incidentCells(TriangulationDSVertex_3<Point_3> u, TriangulationDSVertex_3<Point_3> v) Returns the collection of all triangulation cells incident to edge (u,v).
TriangulationDSVertex_3<X>	insertInCell(X p, TriangulationDSCell_3<X> c) Inserts point p in cell c.
TriangulationDSVertex_3<X>	insertOutside(X point, TriangulationDSCell_3<X> c, int i) Inserts point p outside the triangulation.
boolean	isValid() checks the combinatorial validity of the triangulation.
static void	main(java.lang.String[] args) testing function.
TriangulationDSCell_3<X>	makeTetrahedron(X p1, X p2, X p3, X p4) creates a tetrahedron with vertices p1, p2, p3 and p4.
int	sizeOfCells() returns the number of edges of the triangulation.
int	sizeOfVertices() returns the number of vertices of the triangulation.

Methods inherited from class java.lang.Object

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

Field Detail

cells

public java.util.ArrayList<TriangulationDSCell_3<X extends Point_3>> cells

vertices

public java.util.ArrayList<TriangulationDSVertex_3<X extends Point_3>> vertices

Constructor Detail

TriangulationDS_3

public TriangulationDS_3()

creates an empty triangulation data structure.

TriangulationDS_3

public TriangulationDS_3(int nCells,
                         int nVertices)

creates an empty triangulation data structure with prescribed numbers of cells and vertices.

Method Detail

createCell

public TriangulationDSCell_3<X> createCell()

creates a new cell and adds it to the cells container of the triangulation data structure.

sizeOfVertices

public int sizeOfVertices()

returns the number of vertices of the triangulation.

sizeOfCells

public int sizeOfCells()

returns the number of edges of the triangulation.

Returns:

hasCell

public boolean hasCell(TriangulationDSCell_3<X> c)

checks whether the triangulation contains cell c.

Parameters:

c -

Returns:

hasVertex

public boolean hasVertex(TriangulationDSVertex_3<X> v)

checks whether the triangulation contains vertex v.

createCell

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

areEqual

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

incidentCells

public java.util.Collection<TriangulationDSCell_3<Point_3>> incidentCells(TriangulationDSVertex_3<Point_3> v)

Returns the collection of all triangulation cells incident to vertex v.

incidentCells

public java.util.Collection<TriangulationDSCell_3<Point_3>> incidentCells(TriangulationDSCell_3<Point_3> c,
                                                                          int i,
                                                                          int j)

Returns the collection of all triangulation cells incident to edge (c,i,j).

incidentCells

public java.util.Collection<TriangulationDSCell_3<Point_3>> incidentCells(TriangulationDSVertex_3<Point_3> u,
                                                                          TriangulationDSVertex_3<Point_3> v)

Returns the collection of all triangulation cells incident to edge (u,v).

isValid

public boolean isValid()

checks the combinatorial validity of the triangulation.

makeTetrahedron

public TriangulationDSCell_3<X> makeTetrahedron(X p1,
                                                X p2,
                                                X p3,
                                                X p4)

creates a tetrahedron with vertices p1, p2, p3 and p4.

insertInCell

public TriangulationDSVertex_3<X> insertInCell(X p,
                                               TriangulationDSCell_3<X> c)

Inserts point p in cell c. Cell c is split into 4 tetrahedra. p must lie strictly inside c.

insertOutside

public TriangulationDSVertex_3<X> insertOutside(X point,
                                                TriangulationDSCell_3<X> c,
                                                int i)

Inserts point p outside the triangulation. A new cell is added and attached to cell c (they share the facet opposite to vertex i in c).

main

public static void main(java.lang.String[] args)

testing function.