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,2011 Utrecht University (The Netherlands). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Spatial_searching/include/CGAL/Euclidean_distance.h $ // $Id: include/CGAL/Euclidean_distance.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Hans Tangelder () // Clement Jamin (clement.jamin.pro@gmail.com) #ifndef CGAL_EUCLIDEAN_DISTANCE_H #define CGAL_EUCLIDEAN_DISTANCE_H #include #include #include #include #include #include namespace CGAL { template class Euclidean_distance; namespace internal{ template struct Spatial_searching_default_distance{ typedef ::CGAL::Euclidean_distance type; }; } //namespace internal template class Euclidean_distance { SearchTraits traits; public: typedef typename SearchTraits::FT FT; typedef typename SearchTraits::Point_d Point_d; typedef Point_d Query_item; typedef typename internal::Get_dimension_tag::Dimension D; // default constructor Euclidean_distance(const SearchTraits& traits_=SearchTraits()):traits(traits_) {} inline FT transformed_distance(const Query_item& q, const Point_d& p) const { typename SearchTraits::Construct_cartesian_const_iterator_d construct_it = traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Cartesian_const_iterator_d p_begin = construct_it(p), p_end = construct_it(p, 0); return transformed_distance_from_coordinates(q, p_begin, p_end); } template inline FT transformed_distance_from_coordinates(const Query_item& q, Coord_iterator it_coord_begin, Coord_iterator it_coord_end) const { return transformed_distance_from_coordinates(q, it_coord_begin, it_coord_end, D()); } // Static dim = 2 loop unrolled template inline FT transformed_distance_from_coordinates(const Query_item& q, Coord_iterator it_coord_begin, Coord_iterator /*unused*/, Dimension_tag<2>) const { typename SearchTraits::Construct_cartesian_const_iterator_d construct_it = traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Cartesian_const_iterator_d qit = construct_it(q); FT distance = square(*qit - *it_coord_begin); qit++; it_coord_begin++; distance += square(*qit - *it_coord_begin); return distance; } // Static dim = 3 loop unrolled template inline FT transformed_distance_from_coordinates(const Query_item& q, Coord_iterator it_coord_begin, Coord_iterator /*unused*/, Dimension_tag<3>) const { typename SearchTraits::Construct_cartesian_const_iterator_d construct_it = traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Cartesian_const_iterator_d qit = construct_it(q); FT distance = square(*qit - *it_coord_begin); qit++; it_coord_begin++; distance += square(*qit - *it_coord_begin); qit++; it_coord_begin++; distance += square(*qit - *it_coord_begin); return distance; } // Other cases: static dim > 3 or dynamic dim template inline FT transformed_distance_from_coordinates(const Query_item& q, Coord_iterator it_coord_begin, Coord_iterator /*unused*/, Dim) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it = traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Cartesian_const_iterator_d qit = construct_it(q), qe = construct_it(q, 1); for (; qit != qe; ++qit, ++it_coord_begin) { FT diff = (*qit) - (*it_coord_begin); distance += diff*diff; } return distance; } // During the computation, if the partially-computed distance `pcd` gets greater or equal // to `stop_if_geq_to_this`, the computation is stopped and `pcd` is returned template inline FT interruptible_transformed_distance(const Query_item& q, Coord_iterator it_coord_begin, Coord_iterator /*unused*/, FT stop_if_geq_to_this) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it = traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Cartesian_const_iterator_d qit = construct_it(q), qe = construct_it(q, 1); if (std::distance(qit, qe) >= 6) { // Every 4 coordinates, the current partially-computed distance // is compared to stop_if_geq_to_this // Note: the concept SearchTraits specifies that Cartesian_const_iterator_d // must be a random-access iterator typename SearchTraits::Cartesian_const_iterator_d qe_minus_5 = qe; std::advance(qe_minus_5, -5); for (;;) { FT diff = (*qit) - (*it_coord_begin); distance += diff*diff; ++qit; ++it_coord_begin; diff = (*qit) - (*it_coord_begin); distance += diff*diff; ++qit; ++it_coord_begin; diff = (*qit) - (*it_coord_begin); distance += diff*diff; ++qit; ++it_coord_begin; diff = (*qit) - (*it_coord_begin); distance += diff*diff; ++qit, ++it_coord_begin; if (distance >= stop_if_geq_to_this) return distance; if (std::distance(qe_minus_5, qit) >= 0) break; } } for (; qit != qe; ++qit, ++it_coord_begin) { FT diff = (*qit) - (*it_coord_begin); distance += diff*diff; } return distance; } inline FT min_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it = traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Cartesian_const_iterator_d qit = construct_it(q), qe = construct_it(q, 1); for (unsigned int i = 0; qit != qe; i++, qit++) { if ((*qit) < r.min_coord(i)) distance += (r.min_coord(i) - (*qit))*(r.min_coord(i) - (*qit)); else if ((*qit) > r.max_coord(i)) distance += ((*qit) - r.max_coord(i))*((*qit) - r.max_coord(i)); } return distance; } inline FT min_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r, std::vector& dists) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it = traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Cartesian_const_iterator_d qit = construct_it(q), qe = construct_it(q, 1); for (unsigned int i = 0; qit != qe; i++, qit++) { if ((*qit) < r.min_coord(i)) { dists[i] = (r.min_coord(i) - (*qit)); distance += dists[i] * dists[i]; } else if ((*qit) > r.max_coord(i)) { dists[i] = ((*qit) - r.max_coord(i)); distance += dists[i] * dists[i]; } } return distance; } inline FT max_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it = traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Cartesian_const_iterator_d qit = construct_it(q), qe = construct_it(q, 1); for (unsigned int i = 0; qit != qe; i++, qit++) { if ((*qit) <= (r.min_coord(i) + r.max_coord(i)) / FT(2.0)) distance += (r.max_coord(i) - (*qit))*(r.max_coord(i) - (*qit)); else distance += ((*qit) - r.min_coord(i))*((*qit) - r.min_coord(i)); }; return distance; } inline FT max_distance_to_rectangle(const Query_item& q, const Kd_tree_rectangle& r, std::vector& dists) const { FT distance = FT(0); typename SearchTraits::Construct_cartesian_const_iterator_d construct_it = traits.construct_cartesian_const_iterator_d_object(); typename SearchTraits::Cartesian_const_iterator_d qit = construct_it(q), qe = construct_it(q, 1); for (unsigned int i = 0; qit != qe; i++, qit++) { if ((*qit) <= (r.min_coord(i) + r.max_coord(i)) / FT(2.0)) { dists[i] = (r.max_coord(i) - (*qit)); distance += dists[i] * dists[i]; } else { dists[i] = ((*qit) - r.min_coord(i)); distance += dists[i] * dists[i]; } }; return distance; } inline FT new_distance(FT dist, FT old_off, FT new_off, int /* cutting_dimension */) const { FT new_dist = dist + (new_off*new_off - old_off*old_off); return new_dist; } inline FT transformed_distance(FT d) const { return d*d; } inline FT inverse_of_transformed_distance(FT d) const { return CGAL::sqrt(d); } }; // class Euclidean_distance } // namespace CGAL #endif // EUCLIDEAN_DISTANCE_H