Package ProGAL.geom3d.complex

A simplicial complex is a topological space of a particular kind, constructed by "gluing together" points, line segments, triangles, and their n-dimensional counterparts.

See:
Description

Interface Summary

SimplicialComplex

Class Summary

CEdge
CTetrahedron	An extension of the normal Tetrahedron that is used in complexes.
CTriangle
CVertex

Enum Summary

CVertex.DegenerateCase

Package ProGAL.geom3d.complex Description

A simplicial complex is a topological space of a particular kind, constructed by "gluing together" points, line segments, triangles, and their n-dimensional counterparts. [Wikipedia]

This package contains classes that are all related to three-dimensional simplicial complexes. The specific types of complexes (such as the Delaunay-complex) are implemented in their own sub-packages. All specific complexes use the CVertex, CEdge, CTriangle and CTetrahedron classes as the basic data structure. It is possible to navigate entire components of a complex from any member of the complex. For instance a breadth-first-search from any edge can collect all tetrahedra in that component. The relevant methods for traversing a complex are:

	Going down in simplex dimension	Going up in simplex dimension
CVertex	-	List getAdjacentEdges()
CEdge	CVertex getPoint(int i)	List getAdjacentTriangles()
CTriangle	CEdge getEdge(int i)	CTetrahedron getAdjacentTetrahedron(int i)
CTetrahedron	CTriangle getTriangle(int i)	(CTetrahedron getNeighbor(int i))

For convenience, CTetrahedron has a CTetrahedron getNeighbor(int i) method that gets returns neighbors of the same dimension as itself. None of the other simplices has this functionality.