13 #ifndef LARCOREALG_GEOMETRY_LINECLOSESTPOINT_H 14 #define LARCOREALG_GEOMETRY_LINECLOSESTPOINT_H 23 template <
typename Po
int>
31 operator std::tuple<Point&, double&, double&>() noexcept {
return {
point,
offset1, offset2}; }
83 template <
typename Po
int,
typename Vector>
126 template <
typename Po
int,
typename Vector>
174 template <
typename Po
int,
typename UnitVector>
177 UnitVector
const& dirA,
179 UnitVector
const& dirB);
227 template <
typename Po
int,
typename UnitVector>
229 UnitVector
const& dirA,
231 UnitVector
const& dirB);
242 #endif // LARCOREALG_GEOMETRY_LINECLOSESTPOINT_H
IntersectionPointAndOffsets< Point > LineClosestPointAndOffsets(Point const &startA, Vector const &dirA, Point const &startB, Vector const &dirB)
Returns the point of a line that is closest to a second line.
double offset2
Distance from reference point of second line.
IntersectionPointAndOffsets< Point > LineClosestPointAndOffsetsWithUnitVectors(Point const &startA, UnitVector const &dirA, Point const &startB, UnitVector const &dirB)
Returns the point of a line that is closest to a second line.
Point LineClosestPointWithUnitVectors(Point const &startA, UnitVector const &dirA, Point const &startB, UnitVector const &dirB)
Returns the point of a line that is closest to a second line.
Point point
Intersection point.
std::tuple< double, double, const reco::ClusterHit3D * > Point
Definitions used by the VoronoiDiagram algorithm.
Data structure for return values of LineClosestPointAndOffsets().
Point LineClosestPoint(Point const &startA, Vector const &dirA, Point const &startB, Vector const &dirB)
Returns the point of a line that is closest to a second line.
double offset1
Distance from reference point of first line.