Class for an indexed edge polyhedron in 3-D. More...
#include <IndexedEdgePolyhedron.h>
Public Types | |
typedef T | Number |
The floating point number type. | |
typedef int | SizeType |
The size type is a signed integer. | |
typedef ads::FixedArray < 3, Number > | Point |
The representation of a point in 3 dimensions. | |
typedef ads::FixedArray< 2, int > | IndexedEdge |
The representation of an indexed edge. | |
typedef VertexContainer::const_iterator | VertexConstIterator |
A const iterator on vertices. | |
typedef VertexContainer::iterator | VertexIterator |
An iterator on vertices. | |
typedef EdgeContainer::const_iterator | EdgeConstIterator |
A const iterator on indexed edges. | |
typedef EdgeContainer::iterator | EdgeIterator |
An iterator on indexed edges. | |
Public Member Functions | |
Constructors etc. | |
IndexedEdgePolyhedron () | |
Default constructor. Uninitialized memory. | |
IndexedEdgePolyhedron (const IndexedEdgePolyhedron &other) | |
Copy constructor. | |
IndexedEdgePolyhedron & | operator= (const IndexedEdgePolyhedron &other) |
Assignment operator. | |
~IndexedEdgePolyhedron () | |
Trivial destructor. | |
Mathematical functions. | |
void | computeBBox (BBox< 3, Number > *bb) const |
Make a BBox containing the polyhedron. | |
Accesors. | |
SizeType | getVerticesSize () const |
Return the number of vertices. | |
SizeType | getEdgesSize () const |
Return the number of edges. | |
const Point & | getVertex (const int n) const |
Return a const reference to the specified vertex. | |
const IndexedEdge & | getEdge (const int n) const |
Return a const reference to the specified edge. | |
const Point & | getEdgeSource (const int n) const |
Return a const reference to the specified edge source. | |
const Point & | getEdgeTarget (const int n) const |
Return a const reference to the specified edge target. | |
Manipulators. | |
VertexIterator | getVerticesBeginning () |
VertexIterator | getVerticesEnd () |
EdgeIterator | getEdgesBeginning () |
EdgeIterator | getEdgesEnd () |
void | insertVertex (const Point &x) |
Add a vertex. | |
void | insertEdge (const int i, const int j) |
Add an edge. | |
void | clear () |
Clear the vertices and edges. | |
Equality. | |
bool | isEqualTo (const IndexedEdgePolyhedron &x) const |
Related Functions | |
(Note that these are not member functions.) | |
template<typename T > | |
bool | operator== (const IndexedEdgePolyhedron< T > &a, const IndexedEdgePolyhedron< T > &b) |
Return true if the polyhedra are equal. | |
template<typename T > | |
bool | operator!= (const IndexedEdgePolyhedron< T > &a, const IndexedEdgePolyhedron< T > &b) |
Return true if the polyhedra are not equal. |
Class for an indexed edge polyhedron in 3-D.
T | is the number type. By default it is double. |
This polyhedron stores vertices and indexed edges. (An edge is described by a pair of vertex indices.) With this representation, one can efficiently transform the vertices.
bool operator!= | ( | const IndexedEdgePolyhedron< T > & | a, | |
const IndexedEdgePolyhedron< T > & | b | |||
) | [related] |
Return true if the polyhedra are not equal.
bool operator== | ( | const IndexedEdgePolyhedron< T > & | a, | |
const IndexedEdgePolyhedron< T > & | b | |||
) | [related] |
Return true if the polyhedra are equal.