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/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h $ // $Id: include/CGAL/Arr_trapezoid_ric_point_location.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s): Idit Haran // (based on old version by Oren Nechushtan and Iddo Hanniel) #ifndef CGAL_ARR_TRAPEZOID_RIC_POINT_LOCATION_H #define CGAL_ARR_TRAPEZOID_RIC_POINT_LOCATION_H #include #include /*! \file * Definition of the Arr_trapezoid_ric_point_location template. */ #include #include #include #include namespace CGAL { /*! \class * A class that answers point-location and queries * on a planar arrangement using the trapezoid_ric algorithm. * The Arrangement parameter corresponds to an arrangement instantiation. */ template class Arr_trapezoid_ric_point_location : public Arrangement_::Observer { public: //type of arrangement on surface using Arrangement_on_surface_2 = Arrangement_; using Base_aos = typename Arrangement_on_surface_2::Base_aos; //type of geometry traits using Geometry_traits_2 = typename Base_aos::Geometry_traits_2; //type of traits adaptor using Traits_adaptor_2 = typename Base_aos::Traits_adaptor_2; //type of vertex handle using Vertex_handle = typename Base_aos::Vertex_handle; //type of vertex const handle using Vertex_const_handle = typename Base_aos::Vertex_const_handle; //type of halfedge handle using Halfedge_handle = typename Base_aos::Halfedge_handle; //type of halfedge const handle using Halfedge_const_handle = typename Base_aos::Halfedge_const_handle; //type of face const handle using Face_const_handle = typename Base_aos::Face_const_handle; //type of edge const iterator using Edge_const_iterator = typename Base_aos::Edge_const_iterator; //type of isolated vertex const iterator using Isolated_vertex_const_iterator = typename Base_aos::Isolated_vertex_const_iterator; //type of point using Point_2 = typename Geometry_traits_2::Point_2; //type of x-monotone curve using X_monotone_curve_2 = typename Geometry_traits_2::X_monotone_curve_2; //type of trapezoidal decomposition traits class using Td_traits = CGAL::Td_traits; //type of trapezoidal decomposition class using Trapezoidal_decomposition = Trapezoidal_decomposition_2; //!types of Td_map_item-s using Td_map_item = typename Trapezoidal_decomposition::Td_map_item; using Td_active_vertex = typename Trapezoidal_decomposition::Td_active_vertex; using Td_active_fictitious_vertex = typename Trapezoidal_decomposition::Td_active_fictitious_vertex; using Td_active_edge = typename Trapezoidal_decomposition::Td_active_edge; using Td_active_trapezoid = typename Trapezoidal_decomposition::Td_active_trapezoid; //!type of side tags using Left_side_category = typename Traits_adaptor_2::Left_side_category; using Bottom_side_category = typename Traits_adaptor_2::Bottom_side_category; using Top_side_category = typename Traits_adaptor_2::Top_side_category; using Right_side_category = typename Traits_adaptor_2::Right_side_category; protected: using Result = Arr_point_location_result; using Result_type = typename Result::Type; public: // Support cpp11::result_of using result_type = Result_type; protected: //type of trapezoidal decomposition class using TD = Trapezoidal_decomposition; using All_sides_oblivious_category= typename Arr_all_sides_oblivious_category::result; // Data members: const Traits_adaptor_2* m_traits; // Its associated traits object. TD td; // instance of trapezoidal decomposition bool m_with_guarantees; //for the notification functions X_monotone_curve_2 m_cv_before_split; Halfedge_handle m_he_after_merge; //X_monotone_curve_2 m_cv_before_merge1; //X_monotone_curve_2 m_cv_before_merge2; template Result_type make_result(T t) const { return Result::make_result(t); } inline Result_type default_result() const { return Result::default_result(); } public: /*! constructs default. */ Arr_trapezoid_ric_point_location (bool with_guarantees = true, double depth_thrs = CGAL_TD_DEFAULT_DEPTH_THRESHOLD, double size_thrs = CGAL_TD_DEFAULT_SIZE_THRESHOLD) : m_traits(nullptr), m_with_guarantees(with_guarantees) { td.set_with_guarantees(with_guarantees); td.depth_threshold(depth_thrs); td.size_threshold(size_thrs); } /*! constructs given an arrangement. */ Arr_trapezoid_ric_point_location (const Base_aos& arr, bool with_guarantees = true, double depth_thrs = CGAL_TD_DEFAULT_DEPTH_THRESHOLD, double size_thrs = CGAL_TD_DEFAULT_SIZE_THRESHOLD) : Base_aos::Observer(const_cast(arr)), m_with_guarantees(with_guarantees) { m_traits = static_cast(arr.geometry_traits()); td.set_with_guarantees(with_guarantees); td.init_arrangement_and_traits(&arr); td.depth_threshold(depth_thrs); td.size_threshold(size_thrs); _construct_td(); } /*! destructs. */ ~Arr_trapezoid_ric_point_location() { } /*! defines whether the underlying search structure guarantees logarithmic * query time and linear size */ void with_guarantees(bool with_guarantees) { //if with_guarantees was changed from false to true - reconstruct // the search structure with guarantees td.set_with_guarantees(with_guarantees); if (with_guarantees && !m_with_guarantees) { td.clear(); _construct_td(); } m_with_guarantees = with_guarantees; } /*! returns the depth of the underlying search structure * (the longest path in the DAG) */ unsigned long depth() //longest_dag_path() { return td.largest_leaf_depth() + 1; } /*! returns the longest query path in the underlying search structure */ unsigned long longest_query_path_length() { return td.longest_query_path_length(); } #ifdef CGAL_TD_DEBUG //void locate_and_print (std::ostream& out, const Point_2& p) const //{ td.locate_and_print(out, p); } void print_dag(std::ostream& out) const { td.print_dag(out); } #endif /*! locates the arrangement feature containing the given point. * \param p The query point. * \return An object representing the arrangement feature containing the * query point. This object is either a Face_const_handle or a * Halfedge_const_handle or a Vertex_const_handle. */ result_type locate(const Point_2& p) const; /*! locates the arrangement feature which a upward vertical ray emanating from * the given point hits. * \param p The query point. * \return An object representing the arrangement feature the ray hits. * This object is either an empty object or a * Halfedge_const_handle or a Vertex_const_handle. */ result_type ray_shoot_up(const Point_2& p) const { return (_vertical_ray_shoot(p, true)); } /*! locates the arrangement feature which a downward vertical ray emanating * from the given point hits. * \param p The query point. * \return An object representing the arrangement feature the ray hits. * This object is either an empty object or a * Halfedge_const_handle or a Vertex_const_handle. */ result_type ray_shoot_down(const Point_2& p) const { return (_vertical_ray_shoot(p, false)); } /// \name Notification functions, inherited and overloaded from the // base observer. //@{ /*! Notification before the arrangement is assigned with the content of * another arrangement. * \param arr The other arrangement. Notice that the arrangement type is the * type used to instantiate the observer, which is conveniently * defined as `Arrangement_2::Base_aos`. */ virtual void before_assign(const Base_aos& arr) override { td.clear(); m_traits = static_cast (arr.geometry_traits()); td.init_arrangement_and_traits(&arr, false); } virtual void after_assign() override { _construct_td(); } virtual void before_clear() override { td.clear(); } virtual void after_clear() override { _construct_td(); } /*! Notification before the observer is attached to an arrangement. * \param arr The arrangement that is about to attach the observer. Notice * that the arrangement type is the type used to instantiate the * observer, which is conveniently defined as * `Arrangement_2::Base_aos`. */ virtual void before_attach(const Base_aos& arr) override { td.clear(); m_traits = static_cast (arr.geometry_traits()); td.init_arrangement_and_traits(&arr); } virtual void after_attach() override { _construct_td(); } virtual void before_detach() override { td.clear(); } virtual void after_create_edge(Halfedge_handle e) override { td.insert(e); } //TODO IDIT OREN: what can be done in order to avoid the need //to save the original curve is to find the common endpoint of the //two new halfedges, locate it in the trapezoid in order to find the //curve it lies on, which is the curve that was split, and then remove //this curve. virtual void before_split_edge(Halfedge_handle e, Vertex_handle /* v */, const X_monotone_curve_2& /* cv1 */, const X_monotone_curve_2& /* cv2 */) override { ////MICHAL: commented due to inefficient depth update, remove and insert ////instead save the curve for the "after" function. //m_cv_before_split = e->curve(); //td.before_split_edge(m_cv_before_split, cv1, cv2); td.remove(e); } virtual void after_split_edge(Halfedge_handle e1, Halfedge_handle e2) override { //MICHAL: commented due to inefficient depth update, remove and insert instead //td.split_edge(m_cv_before_split,e1,e2); td.insert(e1); td.insert(e2); } virtual void before_merge_edge(Halfedge_handle e1, Halfedge_handle e2, const X_monotone_curve_2& cv) override { //save the halfedge handle for the "after" function. m_he_after_merge = e1; td.merge_edge (e1, e2, cv); } virtual void after_merge_edge(Halfedge_handle e) override { td.after_merge_edge(e, m_he_after_merge); } virtual void before_remove_edge(Halfedge_handle e) override { td.remove(e); } //@} public: //#ifdef CGAL_TD_DEBUG // void debug() // { // td.debug(); // } //#endif protected: /*! constructs the trapezoidal decomposition. */ void _construct_td() { td.clear(); std::vector he_container; auto* arr = this->arrangement(); //collect the arrangement halfedges for (auto eit = arr->edges_begin(); eit != arr->edges_end(); ++eit) { Halfedge_const_handle he_cst = eit; he_container.push_back(he_cst); } //container insertion td.insert(he_container.begin(), he_container.end()); } /*! obtains the unbounded face that contains the point when the trapezoid is * unbounded * \param tr The unbounded trapezoid whose face we should get * \param p The query point. * \param Arr_all_sides_oblivious_tag * \return A Face_const_handle representing the arrangement unbounded face in * which the point p lies */ Face_const_handle _get_unbounded_face(const Td_map_item& tr, const Point_2& p, Arr_all_sides_oblivious_tag) const; /*! obtains the unbounded face that contains the point when the trapezoid is * unbounded * \param tr The unbounded trapezoid whose face we should get * \param p The query point. * \param Arr_not_all_sides_oblivious_tag * \return A Face_const_handle representing the arrangement unbounded face in * which the point p lies */ Face_const_handle _get_unbounded_face(const Td_map_item& tr, const Point_2& p, Arr_not_all_sides_oblivious_tag) const; /*! locates the arrangement feature which a vertical ray emanating from the * given point hits, considering isolated vertices. * \param p The query point. * \param shoot_up Indicates whether the ray is directed upward or downward. * \return An object representing the arrangement feature the ray hits. * This object is either a Halfedge_const_handle, * a Vertex_const_handle or an empty object. */ result_type _vertical_ray_shoot(const Point_2& p, bool shoot_up) const; /*! in vertical ray shoot, when the closest halfedge is found (or unbounded * face) checks the isolated vertices inside the face to check whether there * is an isolated vertex right above/below the query point. */ result_type _check_isolated_for_vertical_ray_shoot (Halfedge_const_handle halfedge_found, const Point_2& p, bool shoot_up, const Td_map_item& tr) const; }; } //namespace CGAL // The member-function definitions can be found under: #include #include #endif