File indexing completed on 2024-12-15 04:01:13

 /*
  * SPDX-FileCopyrightText: 2019-2023 Mattia Basaglia <dev@dragon.best>
  *
  * SPDX-License-Identifier: GPL-3.0-or-later
  */
 
 #pragma once
 
 #include <QPointF>
 #include <optional>
 #include "vector.hpp"
 
 namespace glaxnimate::math {
 
 /**
  * \brief Finds the closest point to a line
  * \param line_a Point to determine the line
  * \param line_b Second point to determine the line
  * \param p      Point to find the closest of
  * \returns The point on the line that is closest to \p p
  */
 QPointF line_closest_point(const QPointF& line_a, const QPointF& line_b, const QPointF& p);
 
 /**
  * \brief Gets the center of the circle passing through 3 points
  */
 QPointF circle_center(const QPointF& p1, const QPointF& p2, const QPointF& p3);
 
 /**
  * \brief Intersection point between two lines, each defined by two points
  * \note the intersection might lay outside the segments provided
  */
 std::optional<QPointF> line_intersection(const QPointF& start1, const QPointF& end1, const QPointF& start2, const QPointF& end2);
 
 } // namespace glaxnimate::math