IntersectionMap.h

Aller à la documentation de ce fichier.

 
#pragma once
 
#include <unordered_map>
#include <vector>
 
#include "Engine/Core/Coordinates/CoordinateXY.h"
 
struct SegmentId
{
    size_t polylineIndex = 0; 
    size_t pointIndex = 0; 
 
    bool operator==(const SegmentId& o) const
    {
        return polylineIndex == o.polylineIndex
            && pointIndex == o.pointIndex;
    }
};
 
struct IntersectionPoint
{
    CoordinateXY point; 
    double       t = 0; 
    double       u = 0; 
    SegmentId    other; 
};
 
struct GridCell
{
    int col = 0; 
    int row = 0; 
 
    bool operator==(const GridCell& o) const
    {
        return col == o.col && row == o.row;
    }
};
 
struct GridCellHash
{
    size_t operator()(const GridCell& c) const
    {
        // Décalage pour gérer les indices négatifs
        const size_t a = static_cast<size_t>(c.col + 10000);
        const size_t b = static_cast<size_t>(c.row + 10000);
        return (a + b) * (a + b + 1) / 2 + b;
    }
};
 
using SpatialGrid = std::unordered_map<GridCell,
    std::vector<SegmentId>,
    GridCellHash>;
 
struct IntersectionData
{
    std::unordered_map<size_t, std::vector<IntersectionPoint>> intersections;
 
    SpatialGrid grid;
 
    double cellSize = 500.0;
 
    size_t totalIntersections = 0;
 
    void clear()
    {
        intersections.clear();
        grid.clear();
        totalIntersections = 0;
    }
};