triangle.h

#ifndef TRIANGLE_H
#define TRIANGLE_H
 
#include <vector>
#include <array>
#include <iostream>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <sstream>
#include <string>
#include <algorithm>
 
 
#include "geometry/point.h"
#include "geometry/edge.h"
 
namespace Enmesh {

struct Triangle {
 
    static constexpr size_t elementType = 2; 
    static constexpr size_t numVertices = 3; 
 
    std::array<size_t, 3> v;   
    bool isBad = false;     
 

    bool containsEdge(size_t v1, size_t v2) const;
 

    bool containsPoint(const std::vector<Point>& vertices, const Point& point);

    bool operator==(const Triangle& other) const {
        std::array<size_t, 3> sortedV1 = v;
        std::array<size_t, 3> sortedV2 = other.v;
        std::sort(sortedV1.begin(), sortedV1.end());
        std::sort(sortedV2.begin(), sortedV2.end());
        return sortedV1 == sortedV2;
    }
 
};
 

struct TriangleHash {
    size_t operator()(const Triangle& triangle) const {
        // Combine the hashes of the three vertex indices to create a unique hash for the triangle
        size_t h = std::hash<size_t>{}(triangle.v[0]);
        h ^= std::hash<size_t>{}(triangle.v[1]) + 0x9e3779b9 + (h << 6) + (h >> 2);  // Combine with the second vertex index
        h ^= std::hash<size_t>{}(triangle.v[2]) + 0x9e3779b9 + (h << 6) + (h >> 2);  // Combine with the third vertex index
        return h;
    }
};
 
} // namespace Enmesh
 
#endif