#ifndef slic3r_SLA_SuppotstIslands_VoronoiGraphUtils_hpp_
#define slic3r_SLA_SuppotstIslands_VoronoiGraphUtils_hpp_

#include <optional>
#include <map>
#include <set>
#include <libslic3r/Geometry.hpp>
#include <libslic3r/Point.hpp>
#include <libslic3r/SVG.hpp>

#include "VoronoiGraph.hpp"
#include "Parabola.hpp"
#include "SampleConfig.hpp"
#include "SupportIslandPoint.hpp"

namespace Slic3r::sla {

/// <summary>
/// Class which contain collection of static function
/// for work with Voronoi Graph.
/// </summary>
class VoronoiGraphUtils
{
    using VD = Slic3r::Geometry::VoronoiDiagram;

public:
    VoronoiGraphUtils() = delete;

    /// <summary>
    /// Convert coordinate type between voronoi and slicer format
    /// </summary>
    /// <param name="coor">Coordinate</param>
    /// <returns>When it is possible than cast it otherwise empty optional</returns>
    static coord_t to_coord(const VD::coordinate_type &coord);

    /// <summary>
    /// Convert Vodonoi diagram vertex type to Slicer Point
    /// decrease precission by rounding
    /// </summary>
    /// <param name="vertex">Input point pointer(double precission)</param>
    /// <returns>Converted point(int preccission)</returns>
    static Point to_point(const VD::vertex_type *vertex);

    /// <summary>
    /// Convert Slic3r point to Vodonoi point type
    /// extend precission
    /// </summary>
    /// <param name="vertex">Input point(int preccission)</param>
    /// <returns>Converted vertex(double precission)</returns>
    static VD::point_type to_point(const Point &point);

    /// <summary>
    /// Convert point type between voronoi and slicer format
    /// </summary>
    /// <param name="vertex">Input vertex</param>
    /// <returns>created vector</returns>
    static Vec2d to_point_d(const VD::vertex_type* vertex);

    /// <summary>
    /// Convert Slic3r Line to Voronoi segment type
    /// </summary>
    /// <param name="line">input line(int preccission)</param>
    /// <returns>output segment(double precission)</returns>
    static VD::segment_type to_segment(const Line &line);

    /// <summary>
    /// create direction from Voronoi edge
    /// </summary>
    /// <param name="edge">input</param>
    /// <returns>direction --> (vertex1 - vertex0)</returns>
    static Point to_direction(const VD::edge_type *edge);

    /// <summary>
    /// create direction from Voronoi edge
    /// </summary>
    /// <param name="edge">input</param>
    /// <returns>direction --> (vertex1 - vertex0)</returns>
    static Vec2d to_direction_d(const VD::edge_type *edge);

    /// <summary>
    /// check if coord is in limits for coord_t
    /// </summary>
    /// <param name="coord">input value</param>
    /// <param name="source">VD source point coordinate</param>
    /// <param name="max_distance">Maximal distance from source</param>
    /// <returns>True when coord is in +- max_distance from source otherwise FALSE.</returns>
    static bool is_coord_in_limits(const VD::coordinate_type &coord,
                                   const coord_t &            source,
                                   double                     max_distance);

    /// <summary>
    /// Check x and y values of vertex
    /// </summary>
    /// <param name="vertex">input vertex</param>
    /// <param name="source">VD source point</param>
    /// <param name="max_distance">Maximal distance from source</param>
    /// <returns>True when both coord are in limits given by source and max distance otherwise FALSE</returns>
    static bool is_point_in_limits(const VD::vertex_type *vertex,
                                   const Point &          source,
                                   double                 max_distance);
private:
    /// <summary>
    /// PRIVATE: function to help convert edge without vertex to line
    /// </summary>
    /// <param name="point1">VD source point</param>
    /// <param name="point2">VD source point</param>
    /// <param name="maximal_distance">Maximal distance from source point</param>
    /// <returns>Line segment between lines</returns>
    static Line create_line_between_source_points(
        const Point &point1, const Point &point2, double maximal_distance);

public:
    /// <summary>
    /// Convert edge to line
    /// only for line edge
    /// crop infinite edge by maximal distance from source point
    /// inspiration in VoronoiVisualUtils::clip_infinite_edge
    /// </summary>
    /// <param name="edge">VD edge</param>
    /// <param name="points">Source point for voronoi diagram</param>
    /// <param name="maximal_distance">Maximal distance from source point</param>
    /// <returns>Croped line, when all line segment is out of max distance return empty optional</returns>
    static std::optional<Line> to_line(const VD::edge_type &edge,
                                       const Points &       points,
                                       double               maximal_distance);
    /// <summary>
    /// close polygon defined by lines 
    /// close points will convert to their center
    /// Mainly for convert to polygon
    /// </summary>
    /// <param name="lines">Border of polygon, sorted lines CCW</param>
    /// <param name="center">Center point of polygon</param>
    /// <param name="maximal_distance">Radius around center point</param>
    /// <param name="minimal_distance">Merge points closer than minimal_distance</param>
    /// <param name="count_points">Count checking points, create help points for result polygon</param>
    /// <returns>Valid CCW polygon with center inside of polygon</returns>
    static Polygon to_polygon(const Lines &lines,
                              const Point &center,
                              double       maximal_distance,
                              double       minimal_distance,
                              size_t       count_points);
    /// <summary>
    /// Convert cell to polygon
    /// Source for VD must be only point to create VD with only line segments
    /// infinite cell are croped by maximal distance from source point
    /// </summary>
    /// <param name="cell">cell from VD created only by points</param>
    /// <param name="points">source points for VD</param>
    /// <param name="maximal_distance">maximal distance from source point - only for infinite edges(cells)</param>
    /// <returns>polygon created by cell</returns>
    static Polygon to_polygon(const VD::cell_type &cell,
                              const Points &       points,
                              double               maximal_distance);

    // return node from graph by vertex, when no exists create one
    static VoronoiGraph::Node *getNode(VoronoiGraph &         graph,
                                       const VD::vertex_type *vertex,
                                       const VD::edge_type *  edge,
                                       const Lines &          lines);

    /// <summary>
    /// Extract point from lines, belongs to cell
    /// ! Source for VD must be only lines
    /// Main purpose parabola focus point from lines belongs to cell
    /// inspiration in VoronoiVisualUtils::retrieve_point
    /// </summary>
    /// <param name="lines">Source of Voronoi diagram</param>
    /// <param name="cell">Cell inside of Voronoi diagram</param>
    /// <returns>Point from source lines.</returns>
    static Point retrieve_point(const Lines &lines, const VD::cell_type &cell);

    /// <summary>
    /// Extract point from lines
    /// ! Source for VD must be only points
    /// inspiration in VoronoiVisualUtils::retrieve_point
    /// </summary>
    /// <param name="points">Source of Voronoi diagram</param>
    /// <param name="cell">Cell inside of Voronoi diagram</param>
    /// <returns>Point from source points.</returns>
    static const Point& retrieve_point(const Points &points, const VD::cell_type &cell);

private:
    /// <summary>
    /// PRIVATE: function to get parabola focus point
    /// </summary>
    /// <param name="parabola">curved edge</param>
    /// <param name="lines">source lines</param>
    /// <returns>Parabola focus point</returns>
    static Point get_parabola_point(const VD::edge_type &parabola, const Lines &lines);

    /// <summary>
    /// PRIVATE: function to get parabola diretrix
    /// </summary>
    /// <param name="parabola">curved edge</param>
    /// <param name="lines">source lines</param>
    /// <returns>Parabola diretrix</returns>
    static Line get_parabola_line(const VD::edge_type &parabola, const Lines &lines);

public:
    /// <summary>
    /// Construct parabola from curved edge
    /// </summary>
    /// <param name="edge">curved edge</param>
    /// <param name="lines">Voronoi diagram source lines</param>
    /// <returns>Parabola represented shape of edge</returns>
    static Parabola get_parabola(const VD::edge_type &edge, const Lines &lines);

    /// <summary>
    /// Calculate length of curved edge
    /// </summary>
    /// <param name="edge">curved edge</param>
    /// <param name="lines">Voronoi diagram source lines</param>
    /// <returns>edge length</returns>
    static double calculate_length_of_parabola(const VD::edge_type &edge, const Lines &lines);

    /// <summary>
    /// Calculate length of edge line segment or curve - parabola.
    /// </summary>
    /// <param name="edge">Input edge to calcuate length</param>
    /// <param name="lines">Source for Voronoi diagram. It contains parabola parameters</param>
    /// <returns>The length of edge</returns>
    static double calculate_length(const VD::edge_type &edge, const Lines &lines);

    /// <summary>
    /// Calculate maximal distance to outline and multiply by two(must be similar on both side)
    /// ! not used
    /// </summary>
    /// <param name="edge">Input edge.</param>
    /// <param name="lines">Source for Voronoi diagram. It contains parabola parameters</param>
    /// <returns>Maximal island width along edge</returns>
    static double calculate_max_width(const VD::edge_type &edge, const Lines &lines);

    /// <summary>
    /// Calculate width limit(min, max) and round value to coord_t
    /// </summary>
    /// <param name="edge">Input edge</param>
    /// <param name="lines">Source for Voronoi diagram. It contains parabola parameters</param>
    /// <returns>Width range for edge.
    /// First is minimal width on edge.
    /// Second is maximal width on edge.</returns>
    static std::pair<coord_t, coord_t> calculate_width(const VD::edge_type &edge, const Lines &lines);

private:
    static std::pair<coord_t, coord_t> calculate_width_for_line(
        const VD::edge_type &line_edge, const Lines &lines);
    static std::pair<coord_t, coord_t> calculate_width_for_parabola(
        const VD::edge_type &parabola_edge, const Lines &lines);
    static std::pair<coord_t, coord_t> min_max_width(const VD::edge_type &edge, const Point &point);

public:
    /// <summary>
    /// calculate distances to border of island and length on skeleton
    /// </summary>
    /// <param name="voronoi_diagram">Input anotated voronoi diagram
    /// (use function Slic3r::Voronoi::annotate_inside_outside)</param>
    /// <param name="lines">Source lines for voronoi diagram</param>
    /// <returns>Extended voronoi graph by distances and length</returns>
    static VoronoiGraph create_skeleton(const VD &vd, const Lines &lines);

    /// <summary>
    /// find neighbor and return distance between nodes
    /// </summary>
    /// <param name="from">source of neighborse</param>
    /// <param name="to">neighbor node</param>
    /// <returns>When neighbor return distance between neighbor Nodes
    /// otherwise no value</returns>
    static const VoronoiGraph::Node::Neighbor *get_neighbor(
        const VoronoiGraph::Node *from, const VoronoiGraph::Node *to);

    /// <summary>
    /// use function get_neighbor
    /// when not neighbor assert
    /// </summary>
    /// <param name="from">source Node</param>
    /// <param name="to">destination Node</param>
    /// <returns>distance between Nodes or Assert when not neighbor</returns>
    static double get_neighbor_distance(const VoronoiGraph::Node *from,
                                        const VoronoiGraph::Node *to);

    /// <summary>
    /// Create longest node path over circle together with side branches
    /// </summary>
    /// <param name="circle">Source circle, can't be connected with another
    /// circle</param> <param name="side_branches">Circle side branches from
    /// nodes of circle</param> <param name="start_path">Path before circle -
    /// defince input point to circle</param> <returns>Longest nodes path and
    /// its length</returns>
    static VoronoiGraph::Path find_longest_path_on_circle(
        const VoronoiGraph::Circle &                 circle,
        const VoronoiGraph::ExPath::SideBranchesMap &side_branches);

    /// <summary>
    /// Serach longest path from input_node throw Nodes in connected circles,
    /// when circle is alone call find_longest_path_on_circle.
    /// </summary>
    /// <param name="input_node">Node on circle</param>
    /// <param name="finished_circle_index">index of circle with input
    /// node</param> <param name="ex_path">Hold Circles, connection of circles
    /// and Side branches</param> <returns>Longest path from input
    /// node</returns>
    static VoronoiGraph::Path find_longest_path_on_circles(
        const VoronoiGraph::Node &  input_node,
        size_t                      finished_circle_index,
        const VoronoiGraph::ExPath &ex_path);

    /// <summary>
    /// Function for detection circle in passed path.
    /// </summary>
    /// <param name="path">Already passed path in Graph</param>
    /// <param name="neighbor">Actual neighbor possible created circle</param>
    /// <returns>Circle when exists</returns>
    static std::optional<VoronoiGraph::Circle> create_circle(
        const VoronoiGraph::Path &          path,
        const VoronoiGraph::Node::Neighbor &neighbor);

    /// <summary>
    /// Move source connected circles into destination
    /// </summary>
    /// <param name="dst">In/Out param</param>
    /// <param name="src">Input possible modified, do not use it after this
    /// function</param> <param name="dst_circle_count">Count of destination
    /// circles before merge Source circle are append afted destination, therfore
    /// all src indexes must be increased by destination circle count</param>
    static void merge_connected_circle(
        VoronoiGraph::ExPath::ConnectedCircles &dst,
        VoronoiGraph::ExPath::ConnectedCircles &src,
        size_t                                  dst_circle_count);

    /// <summary>
    /// move data from source to destination
    /// side_branches + circles + connected_circle
    /// </summary>
    /// <param name="dst">destination extended path - append data from
    /// source</param> <param name="src">source extended path - data will be
    /// moved to dst</param>
    static void append_neighbor_branch(VoronoiGraph::ExPath &dst,
                                       VoronoiGraph::ExPath &src);

    /// <summary>
    /// Heal starting from random point.
    /// Compare length of all starting path with side branches
    /// when side branch is longer than swap with start path
    /// </summary>
    /// <param name="path">IN/OUT path to be fixed after creating longest path
    /// from one point</param>
    static void reshape_longest_path(VoronoiGraph::ExPath &path);

    /// <summary>
    /// Extract the longest path from voronoi graph
    /// by own function call stack(IStackFunction).
    /// Restructuralize path by branch created from random point.
    /// </summary>
    /// <param name="start_node">Random point from outline.</param>
    static VoronoiGraph::ExPath create_longest_path(
        const VoronoiGraph::Node *start_node);

    /// <summary>
    /// Find twin neighbor
    /// </summary>
    /// <param name="neighbor">neighbor</param>
    /// <returns>Twin neighbor</returns>
    static const VoronoiGraph::Node::Neighbor *get_twin(const VoronoiGraph::Node::Neighbor& neighbor);

    /// <summary>
    /// Find source node of neighbor
    /// </summary>
    /// <param name="neighbor">neighbor</param>
    /// <returns>start node</returns>
    static const VoronoiGraph::Node *get_twin_node(const VoronoiGraph::Node::Neighbor& neighbor);

    /// <summary>
    /// Check if neighbor is in opposit direction to line direction
    /// </summary>
    /// <param name="edge">edge has direction from vertex0 to vertex1</param>
    /// <param name="line">line has direction from point a to point b</param>
    /// <returns>True when oposit direction otherwise FALSE</returns>
    static bool is_opposit_direction(const VD::edge_type *edge, const Line &line);

    /// <summary>
    /// Create point on edge defined by neighbor
    /// in distance defined by edge length ratio
    /// </summary>
    /// <param name="position">Containe neighbor and position ratio on neighbor</param>
    /// <returns>Point laying on neighbor edge</returns>
    static Point create_edge_point(const VoronoiGraph::Position& position);
    static Point create_edge_point(const VD::edge_type *edge, double ratio);

    /// <summary>
    /// Find position on VD edge with width
    /// </summary>
    /// <param name="neighbor">Edge for searching position</param>
    /// <param name="width">Specify place on edge</param>
    /// <param name="lines">Source lines for voronoi diagram</param>
    /// <returns>Position on given edge</returns>
    static VoronoiGraph::Position get_position_with_width(
        const VoronoiGraph::Node::Neighbor *neighbor,
        coord_t              width,
        const Lines &        lines);

    /// <summary>
    /// Calculate both point on source lines correspond to edge postion
    /// Faster way to get both point_on_line
    /// </summary>
    /// <param name="position">Position on edge</param>
    /// <param name="lines">Source lines of VD</param>
    /// <returns>pair of point lay on outline lines correspond to position on edge
    /// first -> source line of edge cell
    /// second -> source line of edge twin cell </returns>
    static std::pair<Point, Point> point_on_lines(
        const VoronoiGraph::Position &position,
        const Lines &                  lines);

    /// <summary>
    /// align "position" close to point "to"
    /// </summary>
    /// <param name="position">input position on VD</param>
    /// <param name="to">point to align</param>
    /// <param name="max_distance">maximal distance on VD for search point</param>
    /// <returns>Position on VD</returns>
    static VoronoiGraph::Position align(const VoronoiGraph::Position &position,
                                        const Point &                 to,
                                        double max_distance);

    /// <summary>
    /// Calc position by ratio to closest point laying on edge
    /// </summary>
    /// <param name="edge">edge to align</param>
    /// <param name="point">point to align</param>
    /// <param name="edge_ratio">output: ratio between vertex0 and vertex1 closest to point, 
    /// when less than zero vertex0 is closest point on edge
    /// when grater than one vertex1 is closest point on edge</param>
    /// <returns>distance edge to "to" point
    /// only when result ratio is in range from 0 to 1 </returns>
    static double get_distance(const VD::edge_type &edge,
                               const Point &        point,
                               double &             edge_ratio);

    static const VoronoiGraph::Node *getFirstContourNode(
        const VoronoiGraph &graph);

    /// <summary>
    /// Get max width from edge in voronoi graph
    /// </summary>
    /// <param name="longest_path">Input point to voronoi graph</param>
    /// <returns>Maximal widht in graph</returns>
    static coord_t get_max_width(const VoronoiGraph::ExPath &longest_path);
    static coord_t get_max_width(const VoronoiGraph::Nodes &path);
    static coord_t get_max_width(const VoronoiGraph::Node *node);

    /// <summary>
    /// Check wheather VG ends in smaller distance than given one
    /// </summary>
    /// <param name="position">Position in direction to checked end</param>
    /// <param name="max_distance">distance to explore</param>
    /// <returns>True when there is only smaller VD path to edge</returns>
    static bool ends_in_distanace(const VoronoiGraph::Position &position, coord_t max_distance);

    /// <summary>
    /// only line created VG
    /// only last neighbor
    /// Calculate angle of outline(source lines) at end of voronoi diagram
    /// </summary>
    /// <param name="neighbor">Neighbor to calculate angle</param>
    /// <returns>Angle of source lines in radians</returns>
    static double outline_angle(const VoronoiGraph::Node::Neighbor &neighbor, const Lines& lines);

    /// <summary>
    /// Loop over neighbor in max distance from position
    /// </summary>
    /// <param name="position">Start of loop</param>
    /// <param name="max_distance">Termination of loop</param>
    /// <param name="fnc">function to process neighbor with actual distance</param>
    static void for_neighbor_at_distance(
        const VoronoiGraph::Position &position,
        coord_t                       max_distance,
        std::function<void(const VoronoiGraph::Node::Neighbor &, coord_t)> fnc);

public: // draw function for debug
    static void draw(SVG &               svg,
                     const VoronoiGraph &graph,
                     const Lines &       lines,
                     const SampleConfig &config,
                     bool                pointer_caption = false);
    static void draw(SVG &                svg,
                     const VD::edge_type &edge,
                     const Lines &        lines,
                     const char *         color,
                     coord_t              width);
    static void draw(SVG &                      svg,
                     const VoronoiGraph::Nodes &path,
                     coord_t                    width,
                     const char *               color,
                     bool                       finish = false,
                     bool caption = false);
    static void draw(SVG &                       svg,
                     const VoronoiGraph::ExPath &path,
                     coord_t                     width);

    // draw polygon when convert from cell
    static void draw(const Slic3r::Polygon &polygon,
                     const Slic3r::Lines &  lines,
                     const Slic3r::Point &  center);
};

} // namespace Slic3r::sla
#endif // slic3r_SLA_SuppotstIslands_VoronoiGraphUtils_hpp_