politopix
4.1.0
|
At the end of the ith iteration, the Voronoi diagram of i seeds is computed. More...
#include <Voronoi_Rn.h>
Public Member Functions | |
IncrementalVoronoi (const boost::shared_ptr< Polytope_Rn > &is, const std::vector< Point_Rn > &lop) | |
Constructor. More... | |
virtual | ~IncrementalVoronoi () |
Destructor. More... | |
virtual bool | compute () throw (std::length_error) |
Run the whole algorithm. More... | |
![]() | |
Voronoi_Rn (const boost::shared_ptr< Polytope_Rn > &inputSpace, const std::vector< Point_Rn > &listOfPoints) | |
Refers to the class WithProperties. More... | |
virtual | ~Voronoi_Rn () |
Destructor. More... | |
boost::shared_ptr< HalfSpace_Rn > | computeMidPlane (std::vector< Point_Rn >::const_iterator seed1, std::vector< Point_Rn >::const_iterator seed2) |
Compute the half-space containing seed1, in between seed1 and seed2, according to the growing seed property. More... | |
const std::vector < boost::shared_ptr < Polytope_Rn > > & | getVoronoiCells () const |
std::vector< boost::shared_ptr < Polytope_Rn > > | getVoronoiCells () |
const std::vector< Point_Rn > & | getListOfSeeds () const |
bool | checkTopologyAndGeometry () const throw (std::domain_error) |
void | dump (std::ostream &out) const |
Dump the cell structure on the given output. More... | |
void | gnuplot (std::ostream &out) const throw (std::domain_error) |
Additional Inherited Members | |
![]() | |
enum | TypeOfAlgorithm { Incremental = 0, CellByCell = 1, CellByCellDist = 2, CellByCellDistNgb = 3, CellByCellDistNgb_1pc = 4, CellByCellDistNgb_10pc = 5, CellByCellDistNgb_20pc = 6, CellByCellDistNgb_30pc = 7, CellByCellDistNgb_40pc = 8, WithProperties = 10 } |
Choose the kind of algorithm to be run. More... | |
![]() | |
const boost::shared_ptr < Polytope_Rn > & | _inputSpace |
The original space to be divided. More... | |
const std::vector< Point_Rn > & | _listOfSeeds |
The list of input points. More... | |
std::vector< boost::shared_ptr < Polytope_Rn > > | _listOfVoronoiCells |
The list of polytopes partitioning the whole space. More... | |
At the end of the ith iteration, the Voronoi diagram of i seeds is computed.
Definition at line 102 of file Voronoi_Rn.h.
|
inline |
Constructor.
Constructor
is | The input space in which the Voronoi diagram is computed |
lop | The list of Voronoi seeds |
Definition at line 111 of file Voronoi_Rn.h.
|
inlinevirtual |
Destructor.
Definition at line 114 of file Voronoi_Rn.h.
|
virtual |
Run the whole algorithm.
Implements Voronoi_Rn.
Definition at line 98 of file Voronoi_Rn.cpp.