1:45 PM 11/12/2025 ���� JFIF    �� �        "" $(4,$&1'-=-157:::#+?D?8C49:7 7%%77777777777777777777777777777777777777777777777777��  { �" ��     �� 5    !1AQa"q�2��BR��#b�������  ��  ��   ? ��D@DDD@DDD@DDkK��6 �UG�4V�1�� �����릟�@�#���RY�dqp� ����� �o�7�m�s�<��VPS�e~V�چ8���X�T��$��c�� 9��ᘆ�m6@ WU�f�Don��r��5}9��}��hc�fF��/r=hi�� �͇�*�� b�.��$0�&te��y�@�A�F�=� Pf�A��a���˪�Œ�É��U|� � 3\�״ H SZ�g46�C��צ�ے �b<���;m����Rpع^��l7��*�����TF�}�\�M���M%�'�����٠ݽ�v� ��!-�����?�N!La��A+[`#���M����'�~oR�?��v^)��=��h����A��X�.���˃����^Ə��ܯsO"B�c>; �e�4��5�k��/CB��.  �J?��;�҈�������������������~�<�VZ�ꭼ2/)Í”jC���ע�V�G�!���!�F������\�� Kj�R�oc�h���:Þ I��1"2�q×°8��Р@ז���_C0�ր��A��lQ��@纼�!7��F�� �]�sZ B�62r�v�z~�K�7�c��5�.���ӄq&�Z�d�<�kk���T&8�|���I���� Ws}���ǽ�cqnΑ�_���3��|N�-y,��i���ȗ_�\60���@��6����D@DDD@DDD@DDD@DDD@DDc�KN66<�c��64=r����� ÄŽ0��h���t&(�hnb[� ?��^��\��â|�,�/h�\��R��5�? �0�!צ܉-����G����٬��Q�zA���1�����V��� �:R���`�$��ik��H����D4�����#dk����� h�}����7���w%�������*o8wG�LycuT�.���ܯ7��I��u^���)��/c�,s�Nq�ۺ�;�ך�YH2���.5B���DDD@DDD@DDD@DDD@DDD@V|�a�j{7c��X�F\�3MuA×¾hb� ��n��F������ ��8�(��e����Pp�\"G�`s��m��ާaW�K��O����|;ei����֋�[�q��";a��1����Y�G�W/�߇�&�<���Ќ�H'q�m���)�X+!���=�m�ۚ丷~6a^X�)���,�>#&6G���Y��{����"" """ """ """ """ ""��at\/�a�8 �yp%�lhl�n����)���i�t��B�������������?��modskinlienminh.com - WSOX ENC ‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！
Warning: Undefined variable $authorization in C:\xampp\htdocs\demo\fi.php on line 57

Warning: Undefined variable $translation in C:\xampp\htdocs\demo\fi.php on line 118

Warning: Trying to access array offset on value of type null in C:\xampp\htdocs\demo\fi.php on line 119

Warning: file_get_contents(https://raw.githubusercontent.com/Den1xxx/Filemanager/master/languages/ru.json): Failed to open stream: HTTP request failed! HTTP/1.1 404 Not Found in C:\xampp\htdocs\demo\fi.php on line 120

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 247

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 248

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 249

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 250

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 251

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 252
// Copyright (c) 2003,2004 INRIA Sophia-Antipolis (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Apollonius_graph_2/include/CGAL/Apollonius_graph_hierarchy_2.h $ // $Id: include/CGAL/Apollonius_graph_hierarchy_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Menelaos Karavelas #ifndef CGAL_APOLLONIUS_GRAPH_HIERARCHY_2_H #define CGAL_APOLLONIUS_GRAPH_HIERARCHY_2_H #include #include #include #include #include #include #include #include #include #include #include namespace CGAL { // parameterization of the hierarchy const unsigned int ag_hierarchy_2__ratio = 30; const unsigned int ag_hierarchy_2__minsize = 20; const unsigned int ag_hierarchy_2__maxlevel = 5; // maximal number of points is 30^5 = 24 millions ! template < class Gt, class Agds = Triangulation_data_structure_2< Apollonius_graph_hierarchy_vertex_base_2< Apollonius_graph_vertex_base_2 >, Triangulation_face_base_2 >, class LTag = Tag_false > class Apollonius_graph_hierarchy_2 : public Apollonius_graph_2< Gt, Agds, LTag > { private: typedef Apollonius_graph_2 Apollonius_graph_base; typedef Apollonius_graph_base Ag_base; public: typedef Gt Geom_traits; typedef typename Gt::Site_2 Site_2; typedef typename Gt::Point_2 Point_2; typedef typename Ag_base::Vertex_handle Vertex_handle; typedef typename Ag_base::Face_handle Face_handle; typedef typename Ag_base::Edge Edge; typedef typename Ag_base::Face_circulator Face_circulator; typedef typename Ag_base::Edge_circulator Edge_circulator; typedef typename Ag_base::Vertex_circulator Vertex_circulator; typedef typename Ag_base::All_faces_iterator All_faces_iterator; typedef typename Ag_base::Finite_faces_iterator Finite_faces_iterator; typedef typename Ag_base::All_vertices_iterator All_vertices_iterator; typedef typename Ag_base::Finite_vertices_iterator Finite_vertices_iterator; typedef typename Ag_base::All_edges_iterator All_edges_iterator; typedef typename Ag_base::Finite_edges_iterator Finite_edges_iterator; typedef typename Ag_base::Sites_iterator Sites_iterator; typedef typename Ag_base::Visible_sites_iterator Visible_sites_iterator; typedef typename Ag_base::Hidden_sites_iterator Hidden_sites_iterator; typedef typename Ag_base::size_type size_type; using Ag_base::insert_first; using Ag_base::insert_second; using Ag_base::insert_third; using Ag_base::is_hidden; using Ag_base::incircle; using Ag_base::edge_interior; using Ag_base::insert_degree_2; using Ag_base::initialize_conflict_region; using Ag_base::expand_conflict_region; using Ag_base::retriangulate_conflict_region; using Ag_base::is_infinite; public: // CREATION //--------- Apollonius_graph_hierarchy_2 (const Geom_traits& gt = Geom_traits()); template Apollonius_graph_hierarchy_2(Input_iterator first, Input_iterator beyond, const Geom_traits& gt = Geom_traits()) : Apollonius_graph_base(gt) { init_hierarchy(gt); insert(first, beyond); } Apollonius_graph_hierarchy_2 (const Apollonius_graph_hierarchy_2& agh); Apollonius_graph_hierarchy_2& operator=(const Apollonius_graph_hierarchy_2& agh); ~Apollonius_graph_hierarchy_2(); protected: // used to initialize the hierarchy at construction time void init_hierarchy(const Geom_traits& gt); public: // INSERTION //---------- template < class Input_iterator > size_type insert(Input_iterator first, Input_iterator beyond) { // copy the sites to a local container typename Apollonius_graph_base::Site_list wp_list; // Site_list wp_list; for (Input_iterator it = first; it != beyond; ++it) { wp_list.push_back(*it); } // sort by decreasing weight typename Apollonius_graph_base::Site_less_than_comparator less_than(this->geom_traits()); std::sort(wp_list.begin(), wp_list.end(), less_than); // now insert typename Apollonius_graph_base::Site_list_iterator lit; for (lit = wp_list.begin(); lit != wp_list.end(); ++lit) { insert(*lit); } // store how many sites where in the range std::size_t num = wp_list.size(); // clear the local container wp_list.clear(); // return the number of sites in range return num; } Vertex_handle insert(const Site_2& p); Vertex_handle insert(const Site_2& p, Vertex_handle vnear) { // the following statement has been added in order to avoid // a g++3.2.1_FreeBSD-RELEASE warning vnear = Vertex_handle(); return insert(p); } public: // REMOVAL //-------- void remove(Vertex_handle v); public: // NEAREST NEIGHBOR LOCATION //-------------------------- public: Vertex_handle nearest_neighbor(const Point_2& p) const; inline Vertex_handle nearest_neighbor(const Point_2& p, Vertex_handle /* vnear */) const { return nearest_neighbor(p); } public: // VALIDITY CHECK //--------------- bool is_valid(bool verbose = false, int level = 1) const; public: // MISCELLANEOUS //-------------- void clear(); void swap(Apollonius_graph_hierarchy_2& agh); // I/O //---- void file_input(std::istream& is); void file_output(std::ostream& os) const; private: // private methods void nearest_neighbor(const Point_2& p, Vertex_handle vnear[ag_hierarchy_2__maxlevel]) const; int random_level(); void copy(const Apollonius_graph_hierarchy_2 &agh); private: // class variables // here is the stack of graphs which form the hierarchy Apollonius_graph_base* hierarchy[ag_hierarchy_2__maxlevel]; boost::rand48 random; // random generator public: template boost::tuples::tuple get_conflicts_and_boundary_and_hidden_vertices(const Site_2& p, OutputItFaces fit, OutputItBoundaryEdges eit, OutputItHiddenVertices vit, Vertex_handle start = Vertex_handle()) const { Vertex_handle vnearest = nearest_neighbor(p.point(), start); return this->get_all(p, fit, eit, vit, vnearest, false); } template std::pair get_conflicts_and_boundary(const Site_2& p, OutputItFaces fit, OutputItBoundaryEdges eit, Vertex_handle start = Vertex_handle()) const { boost::tuples::tuple tup = get_conflicts_and_boundary_and_hidden_vertices(p, fit, eit, Emptyset_iterator(), start); return std::make_pair( boost::tuples::get<0>(tup), boost::tuples::get<1>(tup) ); } template std::pair get_boundary_of_conflicts_and_hidden_vertices(const Site_2& p, OutputItBoundaryEdges eit, OutputItHiddenVertices vit, Vertex_handle start = Vertex_handle()) const { boost::tuples::tuple tup = get_conflicts_and_boundary_and_hidden_vertices(p, Emptyset_iterator(), eit, vit, start); return std::make_pair( boost::tuples::get<1>(tup), boost::tuples::get<2>(tup) ); } template std::pair get_conflicts_and_hidden_vertices(const Site_2& p, OutputItFaces fit, OutputItHiddenVertices vit, Vertex_handle start = Vertex_handle()) const { boost::tuples::tuple tup = get_conflicts_and_boundary_and_hidden_vertices(p, fit, Emptyset_iterator(), vit, start); return std::make_pair( boost::tuples::get<0>(tup), boost::tuples::get<2>(tup) ); } template OutputItFaces get_conflicts(const Site_2& p, OutputItFaces fit, Vertex_handle start = Vertex_handle()) const { boost::tuples::tuple tup = get_conflicts_and_boundary_and_hidden_vertices(p, fit, Emptyset_iterator(), Emptyset_iterator(), start); return boost::tuples::get<0>(tup); } template OutputItBoundaryEdges get_boundary_of_conflicts(const Site_2& p, OutputItBoundaryEdges eit, Vertex_handle start = Vertex_handle()) const { boost::tuples::tuple tup = get_conflicts_and_boundary_and_hidden_vertices(p, Emptyset_iterator(), eit, Emptyset_iterator(), start); return boost::tuples::get<1>(tup); } template OutputItHiddenVertices get_hidden_vertices(const Site_2& p, OutputItHiddenVertices vit, Vertex_handle start = Vertex_handle()) const { boost::tuples::tuple tup = get_conflicts_and_boundary_and_hidden_vertices(p, Emptyset_iterator(), Emptyset_iterator(), vit, start); return boost::tuples::get<2>(tup); } }; template std::ostream& operator<<(std::ostream& os, const Apollonius_graph_hierarchy_2& agh) { agh.file_output(os); return os; } template std::istream& operator>>(std::istream& is, Apollonius_graph_hierarchy_2& agh) { agh.file_input(is); return is; } } //namespace CGAL #include #endif // CGAL_APOLLONIUS_GRAPH_HIERARCHY_2_H