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) 2005,2006,2007,2009,2010,2011 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/Surface_sweep_2/include/CGAL/Surface_sweep_2_algorithms.h $ // $Id: include/CGAL/Surface_sweep_2_algorithms.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s): Baruch Zukerman // Efi Fogel // (based on old version by Tali Zvi) #ifndef CGAL_SURFACE_SWEEP_2_ALGORITHMS_H #define CGAL_SURFACE_SWEEP_2_ALGORITHMS_H #include /*! File * * \file Definition of the surface-sweep related functions. */ #include #include #include #include #include #include #include #include #include #include #include namespace CGAL { namespace Ss2 = Surface_sweep_2; template struct Default_arr_traits {}; template struct Default_arr_traits > { typedef CGAL::Arr_segment_traits_2 Traits; }; template struct Default_arr_traits > { typedef CGAL::Arr_segment_traits_2 Traits; }; template struct Default_arr_traits, typename Kernel::Point_2>> { using Subtraits = CGAL::Arr_segment_traits_2; typedef CGAL::Arr_polyline_traits_2 Traits; }; template struct Default_arr_traits > { typedef CGAL::Arr_conic_traits_2 Traits; }; template class Arr_rational_function_traits_2; namespace Arr_rational_arc{ template class Rational_arc_d_1; } template struct Default_arr_traits > { typedef CGAL::Arr_rational_function_traits_2 Traits; }; template struct Default_arr_traits > { typedef CGAL::Arr_circle_segment_traits_2 Traits; }; template struct Default_arr_traits > { typedef CGAL::Arr_linear_traits_2 Traits; }; /*! Compute all intersection points induced by a range of input curves. * The intersections are calculated using the surface-sweep algorithm. * \param begin An input iterator for the first curve in the range. * \param end A input past-the-end iterator for the range. * \param points Output: An output iterator for the intersection points * induced by the input curves. * \param report_endpoints If (true), the end points of the curves are also * reported as intersection points. * \pre The value-type of CurveInputIterator is Traits::Curve_2, and the * value-type of OutputIterator is Traits::Point_2. */ template OutputIterator compute_intersection_points(CurveInputIterator curves_begin, CurveInputIterator curves_end, OutputIterator points, bool report_endpoints, Traits &tr) { // Define the surface-sweep types: typedef Ss2::Intersection_points_visitor Visitor; typedef Ss2::Surface_sweep_2 Surface_sweep; // Perform the sweep and obtain the intersection points. Visitor visitor(points, report_endpoints); Surface_sweep surface_sweep(&tr, &visitor); visitor.sweep(curves_begin, curves_end); return visitor.output_iterator(); } template OutputIterator compute_intersection_points(CurveInputIterator curves_begin, CurveInputIterator curves_end, OutputIterator points, bool report_endpoints = false) { typedef typename std::iterator_traits::value_type Curve; typename Default_arr_traits::Traits traits; return compute_intersection_points(curves_begin, curves_end, points, report_endpoints, traits); } /*! Compute all x-monotone subcurves that are disjoint in their interiors * induced by a range of input curves. * The subcurves are calculated using the surface-sweep algorithm. * \param begin An input iterator for the first curve in the range. * \param end A input past-the-end iterator for the range. * \param points Output: An output iterator for the subcurve. * \param mult_overlaps If (true), the overlapping subcurve will be reported * multiple times. * \pre The value-type of CurveInputIterator is Traits::Curve_2, and the * value-type of OutputIterator is Traits::X_monotone_curve_2. */ template OutputIterator compute_subcurves(CurveInputIterator curves_begin, CurveInputIterator curves_end, OutputIterator subcurves, bool mult_overlaps, Traits& tr) { // Define the surface-sweep types: typedef Ss2::Subcurves_visitor Visitor; typedef Ss2::Surface_sweep_2 Surface_sweep; // Perform the sweep and obtain the subcurves. Visitor visitor(subcurves, mult_overlaps); Surface_sweep surface_sweep(&tr, &visitor); visitor.sweep(curves_begin, curves_end); return visitor.output_iterator(); } template OutputIterator compute_subcurves(CurveInputIterator curves_begin, CurveInputIterator curves_end, OutputIterator subcurves, bool mult_overlaps = false) { typedef typename std::iterator_traits::value_type Curve; typename Default_arr_traits::Traits m_traits; return compute_subcurves(curves_begin, curves_end, subcurves, mult_overlaps, m_traits); } /*! Determine if there occurs an intersection between any pair of curves in * a given range. * \param begin An input iterator for the first curve in the range. * \param end A input past-the-end iterator for the range. * \return (true) if any pair of curves intersect; (false) otherwise. */ template bool do_curves_intersect(CurveInputIterator curves_begin, CurveInputIterator curves_end, Traits& tr) { // Define the surface-sweep types: typedef Ss2::Do_interior_intersect_visitor Visitor; typedef Ss2::Surface_sweep_2 Surface_sweep; // Perform the sweep and obtain the subcurves. Visitor visitor; Surface_sweep surface_sweep(&tr, &visitor); visitor.sweep(curves_begin, curves_end); return visitor.found_intersection(); } template bool do_curves_intersect(CurveInputIterator curves_begin, CurveInputIterator curves_end) { typedef typename std::iterator_traits::value_type Curve; typename Default_arr_traits::Traits m_traits; return do_curves_intersect(curves_begin, curves_end, m_traits); } } // namespace CGAL #endif