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) 1998-2003 ETH Zurich (Switzerland). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Polytope_distance_d/include/CGAL/all_furthest_neighbors_2.h $ // $Id: include/CGAL/all_furthest_neighbors_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Michael Hoffmann #ifndef CGAL_ALL_FURTHEST_NEIGHBORS_2_H #define CGAL_ALL_FURTHEST_NEIGHBORS_2_H 1 #include #include #include #include #include #include #include namespace CGAL { template < class Operation, class RandomAccessIC > class All_furthest_neighbor_matrix : public Cartesian_matrix< Operation, RandomAccessIC, RandomAccessIC > // represents the matrix used for computing // all furthest neighbors of a convex polygon { public: typedef Cartesian_matrix< Operation, RandomAccessIC, RandomAccessIC > Base; typedef typename Base::Value Value; using Base::number_of_rows; All_furthest_neighbor_matrix(RandomAccessIC f, RandomAccessIC l) : Base(f, l, f, l) {} All_furthest_neighbor_matrix(RandomAccessIC f, RandomAccessIC l, const Operation& o) : Base(f, l, f, l, o) {} int number_of_columns() const { return 2 * number_of_rows() - 1; } Value operator()( int r, int c) const { CGAL_precondition(r >= 0 && r < number_of_rows()); CGAL_precondition(c >= 0 && c < number_of_columns()); if (c <= r) return Value(c - r); else if (c >= r + number_of_rows()) return Value(0); else if (c >= number_of_rows()) return Base::operator()(r, c - number_of_rows()); else return Base::operator()(r, c); } }; } //namespace CGAL #include namespace CGAL { template < class RandomAccessIC, class OutputIterator, class Traits, class IteratorCategory > OutputIterator all_furthest_neighbors_2( RandomAccessIC points_begin, RandomAccessIC points_end, OutputIterator o, const Traits& t, IteratorCategory) { using std::vector; using std::transform; using std::modulus; typedef All_furthest_neighbor_matrix< typename Traits::Compute_squared_distance_2, RandomAccessIC > Afn_matrix; // check preconditions: int number_of_points( static_cast(iterator_distance( points_begin, points_end))); CGAL_precondition( number_of_points > 0); CGAL_expensive_precondition( is_convex_2( points_begin, points_end, t)); // prepare random access container: vector< int > v; v.reserve( number_of_points); for (int i = 0; i < number_of_points; ++i) v.push_back( 0); // compute maxima: monotone_matrix_search( dynamic_matrix( Afn_matrix(points_begin, points_end, t.compute_squared_distance_2_object())), v.begin()); // output result: return transform(v.begin(), v.end(), o, [number_of_points](int i){ return i % number_of_points;} ); } // all_furthest_neighbors_2( ... ) template < class RandomAccessIC, class OutputIterator, class Traits > OutputIterator all_furthest_neighbors_2( RandomAccessIC points_begin, RandomAccessIC points_end, OutputIterator o, const Traits& CGAL_expensive_precondition_code(t), std::random_access_iterator_tag) { typedef All_furthest_neighbor_matrix< typename Traits::Compute_squared_distance_2, RandomAccessIC > Afn_matrix; // check preconditions: int number_of_points( static_cast(iterator_distance( points_begin, points_end))); CGAL_precondition( number_of_points > 0); CGAL_expensive_precondition( is_convex_2( points_begin, points_end, t)); // compute maxima: monotone_matrix_search( dynamic_matrix( Afn_matrix( points_begin, points_end)), o); return o + number_of_points; } // all_furthest_neighbors_2( ... ) template < class RandomAccessIC, class OutputIterator, class Traits > inline OutputIterator all_furthest_neighbors_2( RandomAccessIC points_begin, RandomAccessIC points_end, OutputIterator o, const Traits& t) { typedef typename std::iterator_traits< OutputIterator >::iterator_category iterator_category; return all_furthest_neighbors_2( points_begin, points_end, o, t, iterator_category()); } // all_furthest_neighbors_2( ... ) template < class RandomAccessIC, class OutputIterator > inline OutputIterator all_furthest_neighbors_2( RandomAccessIC points_begin, RandomAccessIC points_end, OutputIterator o) { typedef typename std::iterator_traits< RandomAccessIC >::value_type::R R; return all_furthest_neighbors_2( points_begin, points_end, o, R()); } // all_furthest_neighbors_2( ... ) // backwards compatibility template < class RandomAccessIC, class OutputIterator > inline OutputIterator all_furthest_neighbors( RandomAccessIC points_begin, RandomAccessIC points_end, OutputIterator o) { return all_furthest_neighbors_2( points_begin, points_end, o); } } //namespace CGAL #endif // ! (CGAL_ALL_FURTHEST_NEIGHBORS_2_H) // ---------------------------------------------------------------------------- // ** EOF // ----------------------------------------------------------------------------