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) 1999 // Max-Planck-Institute Saarbruecken (Germany). All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Point_set_2/include/CGAL/Point_set_2.h $ // $Id: include/CGAL/Point_set_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Matthias Baesken #ifndef CGAL_POINT_SET_2_H #define CGAL_POINT_SET_2_H #include #include #include #include #include #include #include #include #include #include #include namespace CGAL { template > > class Point_set_2 : public Delaunay_triangulation_2 { public: typedef Gt Geom_traits; typedef typename Geom_traits::Point_2 Point; typedef typename Geom_traits::Segment_2 Segment; typedef typename Geom_traits::Circle_2 Circle; typedef typename Geom_traits::Orientation_2 Orientation_2; typedef typename Geom_traits::Side_of_oriented_circle_2 Side_of_oriented_circle_2; typedef typename Geom_traits::Construct_circle_2 Construct_circle_2; typedef typename Geom_traits::Compute_squared_distance_2 Compute_squared_distance_2; typedef typename Geom_traits::FT Numb_type; // field number type ... typedef Delaunay_triangulation_2 Triangulation; typedef typename Triangulation::size_type size_type; typedef typename Triangulation::Locate_type Locate_type; typedef typename Triangulation::Face_handle Face_handle; typedef typename Triangulation::Vertex_handle Vertex_handle; typedef typename Triangulation::Edge Edge; typedef typename Triangulation::Vertex Vertex; typedef typename Triangulation::Face Face; typedef typename Triangulation::Edge_circulator Edge_circulator; typedef typename Triangulation::Finite_edges_iterator Finite_edges_iterator; typedef typename Triangulation::Vertex_iterator Vertex_iterator; typedef typename Triangulation::Vertex_circulator Vertex_circulator; typedef typename Triangulation::Edge_iterator Edge_iterator; typedef typename Geom_traits::Bounded_side_2 Circleptori; typedef typename Geom_traits::Compare_distance_2 Comparedist; typedef typename Geom_traits::Construct_center_2 Circlecenter; typedef Unique_hash_map MAP_TYPE; typedef Delaunay_triangulation_2 Base; using Base::finite_vertices_begin; using Base::finite_vertices_end; using Base::number_of_vertices; using Base::VERTEX; using Base::insert; using Base::remove; using Base::locate; using Base::is_infinite; using Base::nearest_vertex; using Base::incident_vertices; Comparedist tr_comparedist; Orientation_2 tr_orientation; Side_of_oriented_circle_2 tr_so_circle; Compute_squared_distance_2 tr_sqrdist; Circleptori tr_circleptori; Circlecenter tr_circlecenter; //constructions... Construct_circle_2 tr_createcircle_3p; Point_set_2() { init_vertex_marks(); } template Point_set_2(InputIterator first, InputIterator last) { init_vertex_marks(); insert(first,last); } ~Point_set_2() {} template OutputIterator vertices(OutputIterator res) // return vertex handles ... { Vertex_iterator vit = finite_vertices_begin(); for (; vit != finite_vertices_end(); vit++) { *res= vit; res++; } return res; } Vertex_handle lookup(Point p) const { if (number_of_vertices() == 0) return nullptr; // locate ... Locate_type lt; int li; Face_handle fh = locate(p,lt,li); if (lt == VERTEX){ Face f = *fh; return f.vertex(li); } else return nullptr; } Vertex_handle nearest_neighbor(Point p) { if (number_of_vertices() == 0) return nullptr; return nearest_vertex(p); } Vertex_handle nearest_neighbor(Vertex_handle v) const { if (number_of_vertices() <= 1) return nullptr; Point p = v->point(); Vertex_circulator vc = incident_vertices(v); Vertex_circulator start =vc; Vertex_handle min_v = vc; if (is_infinite(min_v)){ vc++; min_v = vc; } Vertex_handle act; // go through the vertices ... do { act = vc; if (! is_infinite(act)) { if ( tr_comparedist(p,act->point(), min_v->point()) == SMALLER ) { min_v = act; } } vc++; } while (vc != start); return min_v; } template OutputIterator nearest_neighbors(Point p, size_type k, OutputIterator res) { size_type n = number_of_vertices(); if ( k <= 0 ) return res; if ( n <= k ) { // return all finite vertices ... return vertices(res); } // insert p, if nesessary Vertex_handle vh = lookup(p); bool old_node = true; // we have to add a new vertex ... if (vh == nullptr){ vh = insert(p); old_node = false; k++; } std::list res_list; nearest_neighbors_list(vh, k, res_list); if ( !old_node ) { res_list.pop_front(); remove(vh); } typename std::list::iterator it = res_list.begin(); for (; it != res_list.end(); it++) { *res= *it; res++; } return res; } template OutputIterator nearest_neighbors(Vertex_handle v, size_type k,OutputIterator res) { size_type n = number_of_vertices(); if ( k <= 0 ) return res; if ( n <= k ) { // return all (finite) vertices ... return vertices(res); } std::list res_list; nearest_neighbors_list(v, k, res_list); typename std::list::iterator it = res_list.begin(); for (; it != res_list.end(); it++) { *res= *it; res++; } return res; } void nearest_neighbors_list(Vertex_handle v, size_type k, std::list& res) { size_type n = number_of_vertices(); if ( k <= 0 ) return; if ( n <= k ) { vertices(std::back_inserter(res)); return; } Point p = v->point(); // "unmark" the vertices ... init_search(); MAP_TYPE priority_number; // here we save the priorities ... internal::compare_vertices comp(& priority_number); // comparison object ... std::priority_queue, internal::compare_vertices > PQ(comp); priority_number[v] = 0; PQ.push(v); mark_vertex(v); while ( k > 0 ) { // find minimum from PQ ... Vertex_handle w = PQ.top(); PQ.pop(); res.push_back(w); k--; // get the incident vertices of w ... Vertex_circulator vc = incident_vertices(w); Vertex_circulator start =vc; Vertex_handle act; do { act = vc; if ( (!is_marked(act)) && (! is_infinite(act)) ) { priority_number[act] = tr_sqrdist(p,act->point()); PQ.push(act); mark_vertex(act); } vc++; } while (vc != start); } } // for marking nodes in search procedures size_type cur_mark; Unique_hash_map mark; void init_vertex_marks() { cur_mark = 0; mark.clear(); } void init_search() { cur_mark++; if (cur_mark == (std::numeric_limits::max)()) init_vertex_marks(); } void mark_vertex(Vertex_handle vh) // mark vh as visited ... { mark[vh] = cur_mark; } bool is_marked(Vertex_handle vh) { if (! mark.is_defined(vh)) return false; return (mark[vh] == cur_mark); } void search(Vertex_handle v,const Circle& C, std::list& L) { std::stack todo; todo.push(v); while (!todo.empty()) { Vertex_handle current = todo.top(); todo.pop(); if (is_marked(current)) continue; L.push_back(current); mark_vertex(current); // get incident vertices of v ... Vertex_circulator vc = incident_vertices(current); Vertex_circulator start =vc; Vertex_handle act; // go through the vertices ... do { act = vc; if (! is_infinite(act)) { if (!is_marked(act) && ! (tr_circleptori(C,act->point())==ON_UNBOUNDED_SIDE) ) todo.push(act); } vc++; } while (vc != start); } } template OutputIterator range_search(const Circle& C, OutputIterator res) { if (number_of_vertices() == 0) return res; if (number_of_vertices() == 1) { // get the one vertex ... Vertex_iterator vit = finite_vertices_begin(); Point p = vit->point(); if (! (tr_circleptori(C, p) == ON_UNBOUNDED_SIDE)){ *res= vit; res++; } return res; } // normal case ... Point p = tr_circlecenter(C); Vertex_handle v = lookup(p); bool new_v = false; if ( v == nullptr ) { new_v = true; v = insert(p); } init_search(); std::list L; search(v,C,L); if (new_v) { L.pop_front(); //first one was inserted in range_search ... remove(v); } typename std::list::const_iterator iter = L.begin(); for(;iter != L.end() ;iter++){ *res= *iter; res++; } return res; } template OutputIterator range_search(const Point& a, const Point& b, const Point& c,OutputIterator res) { int orient = (int)(tr_orientation(a,b,c)); Circle C = tr_createcircle_3p(a,b,c); std::list L; range_search(C,std::back_inserter(L)); typename std::list::const_iterator it = L.begin(); for(;it != L.end();it++) { Point p = (*it)->point(); if ( ((int)(tr_orientation(a,b,p))) == - orient || ((int)(tr_orientation(b,c,p))) == - orient || ((int)(tr_orientation(c,a,p))) == - orient ) { } else { *res = *it; res++; } } return res; } template OutputIterator range_search(const Point& a1, const Point& b1, const Point& c1,const Point& d1,OutputIterator res) // a1 upper left, b1 lower left , c1 lower right { //Point b(c.xcoord(),a.ycoord()); //Point d(a.xcoord(),c.ycoord()); Point a=a1,b=b1,c=c1,d=d1; if (tr_orientation(a,b,c) == RIGHT_TURN) { Point tmp = b; b = d; d = tmp; } Circle C = tr_createcircle_3p(a,b,c); std::list L; range_search(C,std::back_inserter(L)); typename std::list::const_iterator it = L.begin(); for(;it != L.end();it++) { Point p = (*it)->point(); if ( tr_orientation(a,b,p) == RIGHT_TURN || tr_orientation(b,c,p) == RIGHT_TURN || tr_orientation(c,d,p) == RIGHT_TURN || tr_orientation(d,a,p) == RIGHT_TURN ) { } else { *res = *it; res++; } } return res; } }; } //namespace CGAL #endif