math_line_segment2.h

[詳解]

 
 
// Copyright(c) 2023-2025 Design Engineering Laboratory, Saitama University
// Released under the MIT license
// https://opensource.org/licenses/mit-license.php
 
#ifndef DESIGNLAB_MATH_LINE_SEGMENT2_H_
#define DESIGNLAB_MATH_LINE_SEGMENT2_H_
 
#include "math_vector2.h"
#include "math_util.h"
 
 
namespace designlab
{
 
struct LineSegment2 final
{
    LineSegment2() = default;
    constexpr LineSegment2(const Vector2& start, const Vector2& end) :
        start(start), end(end) {}
    constexpr LineSegment2(float start_x, float start_y, float end_x, float end_y) :
        start(start_x, start_y), end(end_x, end_y) {}
    constexpr LineSegment2(const LineSegment2& other) = default;
    constexpr LineSegment2(LineSegment2&& other) noexcept = default;
    constexpr LineSegment2& operator=(const LineSegment2& other) = default;
 
    constexpr bool operator==(const LineSegment2& other) const
    {
        return start == other.start && end == other.end;
    }
 
    constexpr bool operator!=(const LineSegment2& other) const
    {
        return !(*this == other);
    }
 
 
    inline float GetLength() const
    {
        return (end - start).GetLength();
    }
 
    constexpr bool IsParallel(const LineSegment2& other) const
    {
        // 外積が0なら平行．
        return math_util::IsEqual(
            (end - start).Cross(other.end - other.start), 0.0f);
    }
 
    Vector2 GetIntersection(const LineSegment2& other) const;
 
    bool HasIntersection(const LineSegment2& other) const;
 
    bool CheckAndGetIntersection(const LineSegment2& other,
                                 Vector2* intersection) const;
 
 
    Vector2 start;  
    Vector2 end;    
};
 
}  // namespace designlab
 
 
#endif  // DESIGNLAB_MATH_LINE_SEGMENT2_H_