|
|
| SegmentTrees (size_t _d=3) |
|
| ~SegmentTrees () |
|
|
void | AddBoundary (const Boundary *_b) |
|
void | AddBoundary (const Boundary *_b, PropertyType _p) |
|
void | BuildSegmentTrees () |
| Build the Segment Trees.
|
|
size_t | FindEnclosingBoundaries (const Point3d &_p, double _e=0.5 *numeric_limits< float >::epsilon()) |
|
|
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) |
|
|
|
|
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 |
|
template<typename PropertyType = size_t>
class SegmentTrees< PropertyType >
CGAL Segment Tree implementation for easy interval (bounding volme) search