Classes | |
class | BSTNode |
BSTNode class definiton specifically for use in constructing Voronoi diagrams. We are trying to follow the prescription described in "Computational Geometry" by Mark de Berg, et al. More... | |
class | BeachLine |
This defines the actual beach line. The idea is to implement this as a self balancing binary search tree. More... | |
class | EventUtilities |
Internal class definitions to facilitate construction of diagram. More... | |
class | IEvent |
class | SiteEvent |
Internal class definitions to facilitate construction of diagram. More... | |
class | CircleEvent |
class | VoronoiDiagram |
VoronoiDiagram class definiton. More... | |
Typedefs | |
using | BSTNodeList = std::list< BSTNode > |
using | RootsPair = std::pair< double, double > |
using | SiteEventList = std::list< SiteEvent > |
using | CircleEventList = std::list< CircleEvent > |
Functions | |
bool | compareSiteEventPtrs (const IEvent *left, const IEvent *right) |
using voronoi2d::BSTNodeList = typedef std::list<BSTNode> |
Definition at line 117 of file BeachLine.h.
using voronoi2d::CircleEventList = typedef std::list<CircleEvent> |
Definition at line 101 of file SweepEvent.h.
using voronoi2d::RootsPair = typedef std::pair<double,double> |
Definition at line 22 of file EventUtilities.h.
using voronoi2d::SiteEventList = typedef std::list<SiteEvent> |
Definition at line 100 of file SweepEvent.h.
bool voronoi2d::compareSiteEventPtrs | ( | const IEvent * | left, |
const IEvent * | right | ||
) |
Definition at line 129 of file Voronoi.cxx.