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/Orthogonal_k_neighbor_search.h $ // $Id: include/CGAL/Orthogonal_k_neighbor_search.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Gael Guennebaud (gael.guennebaud@inria.fr), // Hans Tangelder (), // Clement Jamin (clement.jamin.pro@gmail.com) #ifndef CGAL_ORTHOGONAL_K_NEIGHBOR_SEARCH_H #define CGAL_ORTHOGONAL_K_NEIGHBOR_SEARCH_H #include #include #include #include #include // for std::distance namespace CGAL { template ::type, class Splitter= Sliding_midpoint , class Tree= Kd_tree > class Orthogonal_k_neighbor_search: public internal::K_neighbor_search { typedef internal::K_neighbor_search Base; typedef typename Tree::Point_d Point; public: typedef typename Base::FT FT; private: typename SearchTraits::Cartesian_const_iterator_d query_object_it; internal::Distance_helper m_distance_helper; std::vector dists; int m_dim; Tree const& m_tree; public: Orthogonal_k_neighbor_search(const Tree& tree, const typename Base::Query_item& q, unsigned int k=1, FT Eps=FT(0.0), bool Search_nearest=true, const Distance& d=Distance(),bool sorted=true) : Base(q,k,Eps,Search_nearest,d), m_distance_helper(this->distance_instance, tree.traits()), m_tree(tree) { if (tree.empty()) return; typename SearchTraits::Construct_cartesian_const_iterator_d construct_it=tree.traits().construct_cartesian_const_iterator_d_object(); query_object_it = construct_it(this->query_object); m_dim = static_cast(std::distance(query_object_it, construct_it(this->query_object,0))); dists.resize(m_dim); for(int i=0;isearch_nearest){ distance_to_root = this->distance_instance.min_distance_to_rectangle(q, tree.bounding_box(),dists); compute_nearest_neighbors_orthogonally(tree.root(), distance_to_root); } else { distance_to_root = this->distance_instance.max_distance_to_rectangle(q, tree.bounding_box(),dists); compute_furthest_neighbors_orthogonally(tree.root(), distance_to_root); } if (sorted) this->queue.sort(); } private: // With cache void search_nearest_in_leaf(typename Tree::Leaf_node_const_handle node, Tag_true) { typename Tree::iterator it_node_point = node->begin(), it_node_point_end = node->end(); typename std::vector::const_iterator cache_point_begin = m_tree.cache_begin() + m_dim*(it_node_point - m_tree.begin()); // As long as the queue is not full, the node is just inserted for (; !this->queue.full() && it_node_point != it_node_point_end; ++it_node_point) { this->number_of_items_visited++; FT distance_to_query_object = m_distance_helper.transformed_distance_from_coordinates( this->query_object, *it_node_point, cache_point_begin, cache_point_begin + m_dim); this->queue.insert(std::make_pair(&(*it_node_point), distance_to_query_object)); cache_point_begin += m_dim; } // Now that the queue is full, we can gain time by keeping track // of the current worst distance to interrupt the distance computation earlier FT worst_dist = this->queue.top().second; for (; it_node_point != it_node_point_end; ++it_node_point) { this->number_of_items_visited++; FT distance_to_query_object = m_distance_helper.interruptible_transformed_distance( this->query_object, *it_node_point, cache_point_begin, cache_point_begin + m_dim, worst_dist); if (distance_to_query_object < worst_dist) { this->queue.insert(std::make_pair(&(*it_node_point), distance_to_query_object)); worst_dist = this->queue.top().second; } cache_point_begin += m_dim; } } // Without cache void search_nearest_in_leaf(typename Tree::Leaf_node_const_handle node, Tag_false) { typename Tree::iterator it_node_point = node->begin(), it_node_point_end = node->end(); // As long as the queue is not full, the node is just inserted for (; !this->queue.full() && it_node_point != it_node_point_end; ++it_node_point) { this->number_of_items_visited++; FT distance_to_query_object = this->distance_instance.transformed_distance(this->query_object, *it_node_point); this->queue.insert(std::make_pair(&(*it_node_point), distance_to_query_object)); } // Now that the queue is full, we can gain time by keeping track // of the current worst distance to interrupt the distance computation earlier FT worst_dist = this->queue.top().second; for (; it_node_point != it_node_point_end; ++it_node_point) { this->number_of_items_visited++; FT distance_to_query_object = m_distance_helper.interruptible_transformed_distance( this->query_object, *it_node_point, worst_dist); if (distance_to_query_object < worst_dist) { this->queue.insert(std::make_pair(&(*it_node_point), distance_to_query_object)); worst_dist = this->queue.top().second; } } } void compute_nearest_neighbors_orthogonally(typename Base::Node_const_handle N, FT rd) { if (N->is_leaf()) { // n is a leaf typename Tree::Leaf_node_const_handle node = static_cast(N); this->number_of_leaf_nodes_visited++; if (node->size() > 0) { typename internal::Has_points_cache::type::value>::type dummy; search_nearest_in_leaf(node, dummy); } } else { typename Tree::Internal_node_const_handle node = static_cast(N); this->number_of_internal_nodes_visited++; int new_cut_dim = node->cutting_dimension(); typename Base::Node_const_handle bestChild, otherChild; FT new_off; FT val = *(query_object_it + new_cut_dim); FT diff1 = val - node->upper_low_value(); FT diff2 = val - node->lower_high_value(); if ((diff1 + diff2 < FT(0.0))) { new_off = diff1; bestChild = node->lower(); otherChild = node->upper(); } else // compute new distance { new_off = diff2; bestChild = node->upper(); otherChild = node->lower(); } compute_nearest_neighbors_orthogonally(bestChild, rd); FT dst = dists[new_cut_dim]; FT new_rd = this->distance_instance.new_distance(rd, dst, new_off, new_cut_dim); dists[new_cut_dim] = new_off; if (this->branch_nearest(new_rd)) { compute_nearest_neighbors_orthogonally(otherChild, new_rd); } dists[new_cut_dim] = dst; } } // With cache void search_furthest_in_leaf(typename Tree::Leaf_node_const_handle node, Tag_true) { typename Tree::iterator it_node_point = node->begin(), it_node_point_end = node->end(); typename std::vector::const_iterator cache_point_begin = m_tree.cache_begin() + m_dim*(it_node_point - m_tree.begin()); // In furthest search mode, the interruptible distance cannot be used to optimize for (; it_node_point != it_node_point_end; ++it_node_point) { this->number_of_items_visited++; FT distance_to_query_object = m_distance_helper.transformed_distance_from_coordinates( this->query_object, *it_node_point, cache_point_begin, cache_point_begin + m_dim); this->queue.insert(std::make_pair(&(*it_node_point), distance_to_query_object)); cache_point_begin += m_dim; } } // Without cache void search_furthest_in_leaf(typename Tree::Leaf_node_const_handle node, Tag_false) { typename Tree::iterator it_node_point = node->begin(), it_node_point_end = node->end(); // In furthest search mode, the interruptible distance cannot be used to optimize for (; it_node_point != it_node_point_end; ++it_node_point) { this->number_of_items_visited++; FT distance_to_query_object = this->distance_instance.transformed_distance(this->query_object, *it_node_point); this->queue.insert(std::make_pair(&(*it_node_point), distance_to_query_object)); } } void compute_furthest_neighbors_orthogonally(typename Base::Node_const_handle N, FT rd) { if (N->is_leaf()) { // n is a leaf typename Tree::Leaf_node_const_handle node = static_cast(N); this->number_of_leaf_nodes_visited++; if (node->size() > 0) { typename internal::Has_points_cache::type::value>::type dummy; search_furthest_in_leaf(node, dummy); } } else { typename Tree::Internal_node_const_handle node = static_cast(N); this->number_of_internal_nodes_visited++; int new_cut_dim=node->cutting_dimension(); typename Base::Node_const_handle bestChild, otherChild; FT new_off; FT val = *(query_object_it + new_cut_dim); FT diff1 = val - node->lower_high_value(); FT diff2 = val - node->upper_low_value(); if ( (diff1 + diff2 >= FT(0.0)) ) { new_off = node->upper_low_value()+node->upper_high_value() > val*2? val - node->upper_high_value(): val - node->upper_low_value(); bestChild = node->lower(); otherChild = node->upper(); } else // compute new distance { new_off = node->lower_low_value()+node->lower_high_value() > val*2 ? val - node->lower_high_value(): val - node->lower_low_value(); bestChild = node->upper(); otherChild = node->lower(); } compute_furthest_neighbors_orthogonally(bestChild,rd); FT dst=dists[new_cut_dim]; FT new_rd = this->distance_instance.new_distance(rd,dst,new_off,new_cut_dim); dists[new_cut_dim]=new_off; if (this->branch_furthest(new_rd)) compute_furthest_neighbors_orthogonally(otherChild, new_rd); dists[new_cut_dim]=dst; } } }; // class } // namespace CGAL #include #endif // CGAL_ORTHOGONAL_K_NEIGHBOR_SEARCH_H