Algorithms dealing with a trajectory as a sequence of 3D points. More...
#include "larcorealg/Geometry/geo_vectors_utils.h"
#include <vector>
#include <utility>
#include <iterator>
Go to the source code of this file.
Classes | |
struct | util::PathPointInfo_t< Iter > |
Data returned by findMiddlePointInPath() . More... | |
Namespaces | |
util | |
Namespace for general, non-LArSoft-specific utilities. | |
Functions | |
template<typename FIter , typename LIter > | |
PathPointInfo_t< FIter > | util::findMiddlePointInPath (FIter itFirst, LIter itLast, double relTarget=0.5) |
Returns information to identify the middle of the specified path. More... | |
template<typename FIter , typename LIter > | |
auto | util::pathMiddlePoint (FIter itFirst, LIter itLast, double relTarget=0.5) |
Returns the geometric point in the middle of the specified path. More... | |
template<typename BIter , typename EIter > | |
double | util::pathLength (BIter begin, EIter end) |
Returns the total length of the specified path. More... | |
template<typename BIter , typename EIter > | |
std::vector< double > | util::partialPathLengths (BIter begin, EIter end) |
Returns a sequences of partial lengths for the specified path. More... | |
template<typename Iter , typename SideFunc > | |
std::pair< Iter, Iter > | util::findCrossingSegment (Iter begin, Iter end, SideFunc sideOf) |
Returns a path segment with ends on different sides than path ends. More... | |
Algorithms dealing with a trajectory as a sequence of 3D points.
This is a header-only library.
icarusalg/Utilities
. Definition in file TrajectoryUtils.h.