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) 2006 Tel-Aviv University (Israel). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Union_of_cycles_2.h $ // $Id: include/CGAL/Minkowski_sum_2/Union_of_cycles_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Ron Wein #ifndef CGAL_UNION_OF_CYCLES_2_H #define CGAL_UNION_OF_CYCLES_2_H #include #include #include namespace CGAL { /*! \class * An auxiliary base class for computing the union of the interiors of cycles * of x-monotone curves. */ template class Union_of_cycles_2 { public: typedef Traits_ Traits_2; protected: // Traits types: typedef typename Traits_2::Point_2 Point_2; typedef typename Traits_2::X_monotone_curve_2 X_monotone_curve_2; // Arrangement-related types: typedef Arr_face_extended_dcel Dcel; typedef CGAL::Arrangement_2 Arrangement_2; typedef typename Arrangement_2::Vertex_handle Vertex_handle; typedef typename Arrangement_2::Halfedge_handle Halfedge_handle; typedef typename Arrangement_2::Face_handle Face_handle; typedef typename Arrangement_2::Vertex_iterator Vertex_iterator; typedef typename Arrangement_2::Edge_iterator Edge_iterator; typedef typename Arrangement_2::Halfedge_iterator Halfedge_iterator; typedef typename Arrangement_2::Face_iterator Face_iterator; typedef typename Arrangement_2::Inner_ccb_iterator Inner_ccb_iterator; typedef typename Arrangement_2::Halfedge_around_vertex_circulator Halfedge_around_vertex_circulator; typedef typename Arrangement_2::Ccb_halfedge_circulator Ccb_halfedge_circulator; // Data members: int UNVISITED; // A code marking unvisited faces. public: /*! Default constructor. */ Union_of_cycles_2 () : UNVISITED (-1000000) {} protected: /*! * Construct the arrnagement representing the union of the curve cycles, * such that every arrangement face is associated with its winding number * with respect to the cycles. * \param begin An iterator for the first curve in the range. * \param end A past-the-end iterator for the curve range. * \param arr Output: The arrangement of the curve cycles, where each face * is associated with its winding number. */ template void _construct_arrangement (InputIterator begin, InputIterator end, Arrangement_2& arr) const { CGAL_precondition (arr.is_empty()); // Construct the arrangement of the curves. CGAL::insert (arr, begin, end); // Go over all faces and mark them as unvisited, by setting their inside // count to UNVISITED. Face_iterator fit; for (fit = arr.faces_begin(); fit != arr.faces_end(); ++fit) fit->set_data (UNVISITED); // Mark the inside count of the unbounded face as 0, and start a // breadth-first search from this face, going over the inner boundary of // the single hole (inner CCB) in the unbounded face. const Face_handle uf = arr.unbounded_face(); Face_handle f_next; int next_count; Inner_ccb_iterator iccb_it = uf->inner_ccbs_begin(); Ccb_halfedge_circulator first, circ; Halfedge_handle he; std::list queue; uf->set_data (0); circ = first = *iccb_it; do { he = circ; f_next = he->twin()->face(); if (f_next->data() == UNVISITED) { next_count = _boundary_count (he->twin()); f_next->set_data (next_count); queue.push_back (f_next); } else { CGAL_assertion (f_next->data() == _boundary_count (he->twin())); } ++circ; } while (circ != first); ++iccb_it; // Make sure that there is a single hole in the unbounded face. CGAL_assertion (iccb_it == uf->inner_ccbs_end()); // The main breadth-first search loop. Face_handle f_curr; int curr_count; while (! queue.empty()) { f_curr = queue.front(); curr_count = f_curr->data(); queue.pop_front(); // Go over the outer boundary of the current face to visit its edjacent // faces. circ = first = f_curr->outer_ccb(); do { he = circ; f_next = he->twin()->face(); if (f_next->data() == UNVISITED) { next_count = curr_count + _boundary_count (he->twin()); f_next->set_data (next_count); queue.push_back (f_next); } else if (f_curr != f_next) { CGAL_assertion (f_next->data() == curr_count + _boundary_count (he->twin())); } ++circ; } while (circ != first); // Go over the holes (inner CCBs) of the current face. for (iccb_it = f_curr->inner_ccbs_begin(); iccb_it != f_curr->inner_ccbs_end(); ++iccb_it) { circ = first = *iccb_it; do { he = circ; f_next = he->twin()->face(); if (f_next->data() == UNVISITED) { next_count = curr_count + _boundary_count (he->twin()); f_next->set_data (next_count); queue.push_back (f_next); } else if (f_curr != f_next) { CGAL_assertion (f_next->data() == curr_count + _boundary_count (he->twin())); } ++circ; } while (circ != first); } } return; } private: /*! * Compute the boundary count of the given halfedge, namely the number of * curves going in the halfedges direction minus the number of associated * curves going in the opposite direction. */ int _boundary_count (Halfedge_handle he) const { if ((Arr_halfedge_direction) he->direction() == ARR_LEFT_TO_RIGHT) { // Halfedge is directed from left to right: return (he->curve().label().right_count() - he->curve().label().left_count()); } else { // Halfedge is directed from right to left: return (he->curve().label().left_count() - he->curve().label().right_count()); } } }; } //namespace CGAL #endif