Specialization of Hierarchical Digital Differential Analyzer class that intersects against the leafs or tiles of a generic volume. More...
#include <openvdb/math/DDA.h>
| Public Types | |
| using | LeafT = typename TreeT::LeafNodeType | 
| using | TimeSpanT = typename RayT::TimeSpan | 
| using | ChainT | 
| using | NodeT | 
| using | TimeSpanT | 
| Public Member Functions | |
| VolumeHDDA () | |
| template<typename AccessorT> | |
| TimeSpanT | march (RayT &ray, AccessorT &acc) | 
| template<typename AccessorT, typename ListT> | |
| void | hits (RayT &ray, AccessorT &acc, ListT ×) | 
| VolumeHDDA () | |
| TimeSpanT | march (RayT &ray, AccessorT &acc) | 
| void | hits (RayT &ray, AccessorT &acc, ListT ×) | 
| Friends | |
| class | VolumeHDDA< TreeT, RayT, 1 > | 
| class | VolumeHDDA< TreeT, RayT, ChildNodeLevel+1 > | 
Specialization of Hierarchical Digital Differential Analyzer class that intersects against the leafs or tiles of a generic volume.
| using ChainT | 
| using LeafT = typename TreeT::LeafNodeType | 
| using NodeT | 
| using TimeSpanT | 
| using TimeSpanT = typename RayT::TimeSpan | 
| 
 | inline | 
| 
 | inline | 
| 
 | inline | 
ListType is a list of RayType::TimeSpan and is required to have the two methods: clear() and push_back(). Thus, it could be std::vector<typename RayType::TimeSpan> or std::deque<typename RayType::TimeSpan>.
| 
 | inline | 
| 
 | inline | 
| 
 | inline | 
| 
 | friend | 
| 
 | friend |