#include <SweepPlane.h>
template<typename LineType, int dim>
struct model::SweepPlane< LineType, dim >
https://en.wikipedia.org/wiki/Bentley–Ottmann_algorithm
Definition at line 27 of file SweepPlane.h.
◆ EventContainerType
template<typename LineType, int dim>
◆ EventMapType
template<typename LineType, int dim>
| typedef std::map<typename LineType::KeyType,const LineType*> model::SweepPlane< LineType, dim >::EventMapType |
◆ IntersectionPairContainerType
template<typename LineType, int dim>
| typedef std::deque<std::pair<const LineType*,const LineType*> > model::SweepPlane< LineType, dim >::IntersectionPairContainerType |
◆ addSegment()
template<typename LineType, int dim>
| void model::SweepPlane< LineType, dim >::addSegment |
( |
const double & | xStart, |
|
|
const double & | xEnd, |
|
|
const LineType & | line ) |
|
inline |
◆ computeIntersectionPairs()
template<typename LineType, int dim>
◆ events() [1/2]
template<typename LineType, int dim>
◆ events() [2/2]
template<typename LineType, int dim>
◆ potentialIntersectionPair()
template<typename LineType, int dim>
| const std::pair< const LineType *, const LineType * > & model::SweepPlane< LineType, dim >::potentialIntersectionPair |
( |
const size_t & | k | ) |
const |
|
inline |
◆ potentialIntersectionPairs()
template<typename LineType, int dim>
The documentation for this struct was generated from the following file: