mesh_analyzer/triangle_8h_source.html

#include <vector>

#include <array>

#include <iostream>

#include <cmath>

#include <unordered_set>

#include <unordered_map>

#include <fstream>

#include <sstream>

#include <string>


#include "geometry/point.h"

#include "geometry/edge.h"


struct Triangle {


    std::array<int, 3> v;

    bool isBad = false;


    bool containsEdge(int v1, int v2) const;


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


};


Point
A struct representing a point in 3D space.
Definition point.h:12

Triangle
A struct representing a triangle in the mesh.
Definition triangle.h:19

Triangle::v
std::array< int, 3 > v
Indices of the vertices that form the triangle.
Definition triangle.h:21

Triangle::isBad
bool isBad
Flag used in Delaunay triangulation to mark triangles that need to be removed.
Definition triangle.h:22

Triangle::containsPoint
bool containsPoint(const std::vector< Point > &vertices, const Point &P)
Check if the circum circle of the triangle contains a specific point.
Definition triangle.cpp:11

Triangle::containsEdge
bool containsEdge(int v1, int v2) const
Check if the triangle contains a specific edge defined by two vertex indices.
Definition triangle.cpp:4