#pragma once
#include <vector>
#include <set>
#include <map>
#include "TinyVector.h"
#include "Tree.h"

#define th_smooth_cos_value 0.939692

void greedy_graph_coloring(const size_t num_vertices, const std::vector<std::set<size_t>>& edges, std::vector<std::vector<size_t>>& colored_vertices);

void get_graph_component(const std::vector<std::set<size_t>>& edges, std::vector<std::set<size_t>>& components);

template<typename T>
T compute_tri_area(const TinyVector<T, 3>& v0, const TinyVector<T, 3>& v1, const TinyVector<T, 3>& v2)
{
	return ((v1 - v0).Cross(v2 - v0)).Length() * (T)0.5;
}

#include "Eigen/Dense"
void compute_shortest_dist_AABB(const Eigen::MatrixXd& input_pts, const Eigen::MatrixXi input_faces, const std::vector<TinyVector<double, 3>>& queries, std::vector<TinyVector<double, 3>>& res, std::vector<double>& dist, std::vector<size_t>& faceid);

void compute_vert_mean_curvature(const std::vector<TinyVector<double, 3>>& pos, const std::vector<TinyVector<size_t, 3>> &faces, std::vector<double>& curvature);

void update_tree_color(const std::vector<size_t>& new_color, TreeNode<size_t>* t);

bool get_tree_from_convex_graph(const std::vector<std::set<size_t>> &graph, const std::map<std::pair<size_t, size_t>, int>& flag_fpconvex, bool flag_convex, TreeNode<size_t>* tn, int layer, std::vector<size_t> &invalid_graphs);


TinyVector<double, 3> perturb_normal(const TinyVector<double, 3> normal, double angle_noise1, double angle_noise2);

bool sample_pts_from_mesh(const std::vector<TinyVector<double, 3>>& tri_verts, const std::vector<TinyVector<size_t, 3>>& tri_faces, const std::vector<TinyVector<double, 3>>& tri_normals, const std::vector<int>& tri_face_masks, int n_sample, std::vector<TinyVector<double, 3>>& output_pts, std::vector<TinyVector<double, 3>>& output_normals, std::vector<int>& output_masks, double sigma = -1.0, double sigma_n = -1.0);

#include "Mesh3D.h"
//cluster mesh faces according to feature edges
void get_grouped_edges(Mesh3d& m, const std::vector<bool>& he_feautre_flag, const std::vector<std::vector<int>>& feature_v2he, std::vector<std::vector<int>>& grouped_features, std::vector<int>& he2gid);
int cluster_mesh_faces(Mesh3d* m, const std::vector<bool>& he_feature_flag, std::vector<std::vector<int>> &grouped_features, int cluster_begin_id, std::vector<int>& face2cluster, std::vector<std::pair<int, int>>& feature_twoface_colors);

void get_cluster_from_coloring(const std::vector<int>& face_color, int color_start_id, std::vector<std::vector<int>>& face_clusters);
int merge_clusters(Mesh3d* m, const std::vector<bool>& he_feature_flag, int cluster_start_id, int n_cluster, const std::vector<std::pair<int, int>>& feature_twoface_colors, std::vector<int>& face_color);

int get_mesh_edge_type(Mesh3d& m, int heid); //0: smooth, 1: convex, 2: concave

void get_all_tri_area(Mesh3d& m, std::vector<double>& area);
void get_mesh_vert_faces(Mesh3d& m, std::vector<std::array<double, 3>>& pos, std::vector<std::vector<size_t>>& faces);
bool dijkstra_mesh(Mesh3d* m, size_t start_vert, std::vector<size_t>& prev_map, std::vector<double>& dist);
void repair_tree_features(Mesh3d& m, const std::vector<int>& face_color, const std::vector<size_t>& invalid_colors, std::vector<std::pair<int, int>>& ungrouped_features);

void repair_tree_features_maxflow(Mesh3d& m, const std::vector<int>& face_color, const std::vector<size_t>& invalid_colors, std::vector<std::pair<int, int>>& ungrouped_features);

typedef TinyVector<double, 3> vec3d;
bool load_xyz_file(const char* filename, std::vector<vec3d>& pts, std::vector<vec3d>& normals);