The AreaCon Library
1.0
A C++ library for area-constrained partitioning operations
|
#include <areacon.h>
Public Member Functions | |
DelaunayGraph (const int NRegions) | |
DelaunayGraph (const DelaunayGraph &obj) | |
DelaunayGraph & | operator= (const DelaunayGraph &obj) |
~DelaunayGraph () | |
Public Attributes | |
Point *** | Graph |
const int | NRegions |
Container for storing Delaunay (duel) graphs.
AreaCon::DelaunayGraph::DelaunayGraph | ( | const int | NRegions | ) |
Constructor.
[in] | NRegions | The number of regions in the partition or the number of nodes in the Delaunay graph |
AreaCon::DelaunayGraph::DelaunayGraph | ( | const DelaunayGraph & | obj | ) |
Copy Constructor
[in] | obj | Element to by copied |
AreaCon::DelaunayGraph::~DelaunayGraph | ( | ) |
Destructor. Cleans up dynamically allocated memory.
DelaunayGraph & AreaCon::DelaunayGraph::operator= | ( | const DelaunayGraph & | obj | ) |
Copy Assignment Operator
[in] | obj | Element to by copied |
Point*** AreaCon::DelaunayGraph::Graph |
A multi-dimensional array whose (i,j)-th entry holds the endpoints of the line segment that is shared by region i and region j. If the two regions do not share a common edge, then at least 1 index of the (i,j)-th entry will equal INFINITY.
const int AreaCon::DelaunayGraph::NRegions |
The number of regions under consideration.