![]() |
Parasol Planning Library (PPL)
|
#include <SegmentTrees.h>
Public Types | |
Local types | |
{ | |
| typedef CGAL::Cartesian< double > | CK |
| typedef CGAL::Segment_tree_map_traits_2< CK, size_t > | Traits2 |
| typedef CGAL::Segment_tree_2< Traits2 > | Segment_tree_2_type |
| typedef CGAL::Segment_tree_map_traits_3< CK, size_t > | Traits3 |
| typedef CGAL::Segment_tree_3< Traits3 > | Segment_tree_3_type |
| typedef Traits2::Interval | Interval2 |
| typedef Traits3::Interval | Interval3 |
| typedef Traits2::Pure_interval | Pure_interval2 |
| typedef Traits3::Pure_interval | Pure_interval3 |
| typedef Traits2::Key | Key2 |
| typedef Traits3::Key | Key3 |
Public Member Functions | |
Construction | |
| SegmentTrees (size_t _d=3) | |
| ~SegmentTrees () | |
Modifiers | |
| void | AddBoundary (const Boundary *_b) |
| void | AddBoundary (const Boundary *_b, PropertyType _p) |
| void | BuildSegmentTrees () |
| Build the Segment Trees. More... | |
| size_t | FindEnclosingBoundaries (const Point3d &_p, double _e=0.5 *numeric_limits< float >::epsilon()) |
Accessors | |
| size_t | GetNumberEnclosingBoundaries () |
| size_t | GetOutputBoundaryIndex (size_t _i) |
| PropertyType | GetOutputBoundaryProperty (size_t _i) |
| const Boundary * | GetOutputBoundary (size_t _i) |
| size_t | GetDimension () |
| void | SetDimension (size_t _d=3) |
CGAL Segment Tree implementation for easy interval (bounding volme) search
| typedef CGAL::Cartesian<double> SegmentTrees< PropertyType >::CK |
| typedef Traits2::Interval SegmentTrees< PropertyType >::Interval2 |
| typedef Traits3::Interval SegmentTrees< PropertyType >::Interval3 |
| typedef Traits2::Key SegmentTrees< PropertyType >::Key2 |
| typedef Traits3::Key SegmentTrees< PropertyType >::Key3 |
| typedef Traits2::Pure_interval SegmentTrees< PropertyType >::Pure_interval2 |
| typedef Traits3::Pure_interval SegmentTrees< PropertyType >::Pure_interval3 |
| typedef CGAL::Segment_tree_2<Traits2> SegmentTrees< PropertyType >::Segment_tree_2_type |
| typedef CGAL::Segment_tree_3<Traits3> SegmentTrees< PropertyType >::Segment_tree_3_type |
| typedef CGAL::Segment_tree_map_traits_2<CK, size_t> SegmentTrees< PropertyType >::Traits2 |
| typedef CGAL::Segment_tree_map_traits_3<CK, size_t> SegmentTrees< PropertyType >::Traits3 |
| SegmentTrees< PropertyType >::SegmentTrees | ( | size_t | _d = 3 | ) |
| SegmentTrees< PropertyType >::~SegmentTrees |
|
inline |
Add a boundary
| _b | Boundaries. |
| void SegmentTrees< PropertyType >::AddBoundary | ( | const Boundary * | _b, |
| PropertyType | _p | ||
| ) |
Add a boundary with a property index
| _b | Boundaries. |
| _p | Property index |
| void SegmentTrees< PropertyType >::BuildSegmentTrees |
Build the Segment Trees.
| size_t SegmentTrees< PropertyType >::FindEnclosingBoundaries | ( | const Point3d & | _p, |
| double | _e = 0.5*numeric_limits<float>::epsilon() |
||
| ) |
Finds the Number of Enclosing Boundaries
| _p | Point to search |
| _e | Range of the point |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |