14 #ifndef LARCOREALG_GEOMETRY_LINECLOSESTPOINT_H 15 #define LARCOREALG_GEOMETRY_LINECLOSESTPOINT_H 24 template <
typename Po
int>
32 operator std::tuple<Point&, double&, double&>() noexcept {
return {
point,
offset1, offset2}; }
84 template <
typename Po
int,
typename Vector>
127 template <
typename Po
int,
typename Vector>
175 template <
typename Po
int,
typename UnitVector>
178 UnitVector
const& dirA,
180 UnitVector
const& dirB);
228 template <
typename Po
int,
typename UnitVector>
230 UnitVector
const& dirA,
232 UnitVector
const& dirB);
243 #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.
Namespace collecting geometry-related classes utilities.
double offset1
Distance from reference point of first line.