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) 2002-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/GraphicsView/include/CGAL/apply_to_range.h $ // $Id: include/CGAL/apply_to_range.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Radu Ursu #ifndef CGAL_APPLY_TO_RANGE_H #define CGAL_APPLY_TO_RANGE_H #include #include #include #include namespace CGAL{ template void apply_to_range(const Tr &t, const Point_2 &p1, const Point_2 &p2, Fct& fct) { if (t.dimension()<2) return; typedef typename Tr::Point POINT; typedef typename Tr::Face_handle hFACE; typedef typename Tr::Vertex_handle hVERTEX; typedef typename Tr::Line_face_circulator LFC; typedef typename Tr::Finite_vertices_iterator FVI; typedef typename Tr::Finite_faces_iterator FFI; typedef typename Kernel_traits::Kernel K; typedef typename K::FT FT; LFC l1, l2, l3, l4; //the faces that intersect the pixmap RECTANGLE hFACE hface1, hface2, hface3, hface4; //the faces where we start to search FT xr_left, yr_top, xr_right, yr_bottom;//the coordinates of the screen boundaries CGAL::Unique_hash_map visited(false);//used for DFS std::stack face_stack; //used for DFS xr_left = p1.x(); xr_right = p2.x(); yr_top = p1.y(); yr_bottom = p2.y(); hface1 = t.locate(POINT(xr_left, yr_top)); hface2 = t.locate(POINT(xr_right, yr_top)); hface3 = t.locate(POINT(xr_right, yr_bottom)); hface4 = t.locate(POINT(xr_left, yr_bottom)); l1 = t.line_walk(POINT(xr_left, yr_top), POINT(xr_right, yr_top), hface1); l2 = t.line_walk(POINT(xr_right, yr_top), POINT(xr_right, yr_bottom), hface2); l3 = t.line_walk(POINT(xr_right, yr_bottom), POINT(xr_left, yr_bottom), hface3); l4 = t.line_walk(POINT(xr_left, yr_bottom), POINT(xr_left, yr_top), hface4); //test if everything is inside or outside if( (l1 == nullptr) && (l2 == nullptr) && (l3 == nullptr) && (l4 == nullptr)) { FVI v = t.finite_vertices_begin(); if((*v).point().x() < xr_left || (*v).point().x() > xr_right || (*v).point().y() < yr_bottom || (*v).point().y() > yr_top) //true if everything is outside return; else{ //everything is inside FFI it = t.finite_faces_begin(); while(it != t.finite_faces_end()) { fct(it); it++; } } return; } //if we are here, then a part of the triangulation is inside, the other is outside //put all the faces on the boundaries in the stack and the map if(l1 != nullptr) //found at least one face that intersect the TOP segment { while (t.is_infinite(l1)) l1++; //we should start with a finite face do{ //put all of them in the stack; face_stack.push(l1); visited[l1] = true; l1++; }while(!t.is_infinite(l1) && t.triangle(l1).has_on_unbounded_side(POINT(xr_right, yr_top))); } if(l2 != nullptr) //found at least one face that intersect the RIGHT segment { while (t.is_infinite(l2)) l2++; //we should start with a finite face do{ //put all of them in the stack; if(!visited[l2]){ face_stack.push(l2); visited[l2] = true; } l2++; }while(!t.is_infinite(l2) && t.triangle(l2).has_on_unbounded_side(POINT(xr_right, yr_bottom))); } if(l3 != nullptr) //found at least one face that intersect the BOTTOM segment { while (t.is_infinite(l3)) l3++; //we should start with a finite face do{ //put all of them in the stack; if(!visited[l3]){ face_stack.push(l3); visited[l3] = true; } l3++; }while(!t.is_infinite(l3) && t.triangle(l3).has_on_unbounded_side(POINT(xr_left, yr_bottom))); } if(l4 != nullptr) //found at least one face that intersect the LEFT segment { while (t.is_infinite(l4)) l4++; //we should start with a finite face do{ //put all of them in the stack; if(!visited[l4]){ face_stack.push(l4); visited[l4] = true; } l4++; }while(!t.is_infinite(l4) && t.triangle(l4).has_on_unbounded_side(POINT(xr_left, yr_top))); } //HERE we begin to walk through the faces DFS hFACE hf; typename CGAL::Unique_hash_map::Data& data_ref_start(visited[hf]); data_ref_start = true; while(!face_stack.empty()){ hf = face_stack.top(); face_stack.pop(); //done with this face for (int i=0; i<3; i++){ //visit all the neighbors if(!visited[(*hf).neighbor(i)] ) if(!t.is_infinite((*hf).neighbor(i))){ //true if it is not an infinite face hVERTEX hv = (*(*hf).neighbor(i)).vertex((*(*hf).neighbor(i)).index(hf)); if(!((*hv).point().x() < xr_left || (*hv).point().x() > xr_right || (*hv).point().y() < yr_bottom || (*hv).point().y() > yr_top)) //true if the vertex is outside face_stack.push((*hf).neighbor(i)); typename CGAL::Unique_hash_map::Data& data_ref(visited[(*hf).neighbor(i)]); data_ref = true; } } fct(hf); } } }//end namespace #endif //CGAL_APPLY_TO_RANGE_H