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) 2006 Foundation for Research and Technology-Hellas (Greece). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Halfedge.h $ // $Id: include/CGAL/Voronoi_diagram_2/Halfedge.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Menelaos Karavelas #ifndef CGAL_VORONOI_DIAGRAM_2_HALFEDGE_2_H #define CGAL_VORONOI_DIAGRAM_2_HALFEDGE_2_H 1 #include #include #include #include namespace CGAL { namespace VoronoiDiagram_2 { namespace Internal { template class Halfedge { private: typedef Halfedge Self; typedef Triangulation_cw_ccw_2 CW_CCW_2; typedef typename VDA::Delaunay_graph DG; typedef typename DG::Face_handle Delaunay_face_handle; typedef typename DG::Vertex_circulator Delaunay_vertex_circulator; typedef typename DG::Edge_circulator Delaunay_edge_circulator; typedef typename VDA::Accessor::Edge_rejector Edge_rejector; typedef typename VDA::Accessor::Face_rejector Face_rejector; private: Self find_next_1D() const { Delaunay_vertex_circulator vc = vda_->dual().incident_vertices(v1_); while ( v2_ == vc ) { ++vc; } if ( vda_->dual().is_infinite(vc) ) { return *this; } return Self(vda_, v1_, vc); } void find_next(const Delaunay_face_handle& f, int i, Delaunay_face_handle& fnext, int& inext) const { Find_next_halfedge()(vda_, f, i, fnext, inext); } void find_opposite(const Delaunay_face_handle& f, int i, Delaunay_face_handle& fopp, int& iopp) const { Find_opposite_halfedge()(vda_, f, i, fopp, iopp); } public: typedef typename VDA::Vertex Vertex; typedef typename VDA::Face Face; typedef typename VDA::Vertex_handle Vertex_handle; typedef typename VDA::Face_handle Face_handle; typedef typename VDA::Halfedge_handle Halfedge_handle; typedef typename VDA::Ccb_halfedge_circulator Ccb_halfedge_circulator; typedef typename VDA::Delaunay_graph Delaunay_graph; typedef typename Delaunay_graph::Edge Delaunay_edge; typedef typename Delaunay_graph::Vertex_handle Delaunay_vertex_handle; // CONSTRUCTORS //------------- Halfedge(const VDA* vda = nullptr) : vda_(vda), f_(Delaunay_face_handle()), i_(-1), v1_(Delaunay_vertex_handle()), v2_(Delaunay_vertex_handle()) {} Halfedge(const VDA* vda, Delaunay_face_handle f, int i) : vda_(vda), f_(f), i_(i), v1_(Delaunay_vertex_handle()), v2_(Delaunay_vertex_handle()) { CGAL_precondition( vda_->dual().dimension() == 2 ); CGAL_precondition( !vda_->edge_rejector()(vda_->dual(), f_, i_) ); } Halfedge(const VDA* vda, Delaunay_vertex_handle v1, Delaunay_vertex_handle v2) : vda_(vda), f_(Delaunay_face_handle()), i_(-2), v1_(v1), v2_(v2) { CGAL_precondition( vda_->dual().dimension() == 1 ); CGAL_precondition( !vda_->dual().is_infinite(v1_) ); } // ACCESS TO NEIGHBORING HALFEDGES //-------------------------------- Halfedge_handle opposite() const { if ( vda_->dual().dimension() == 1 ) { return Halfedge_handle( Self(vda_, v2_, v1_) ); } int cw_i = CW_CCW_2::cw(i_); if ( vda_->face_rejector()(vda_->dual(), f_->vertex(cw_i)) ) { Delaunay_face_handle fopp; int iopp; find_opposite(f_, i_, fopp, iopp); //equivalent to: twin().next().twin(); return Halfedge_handle( Self(vda_, fopp, iopp) ); } else { int i_mirror = vda_->dual().tds().mirror_index(f_, i_); return Halfedge_handle( Self(vda_, f_->neighbor(i_), i_mirror) ); } } inline Halfedge_handle twin() const { return opposite(); } Halfedge_handle next() const { if ( vda_->dual().dimension() == 1 ) { return Halfedge_handle( find_next_1D() ); } // if I want to return all edges and not just the finite ones, // replace the do-while loop by the following statements: // find_next(f_, i_, f, i); Delaunay_face_handle f = f_, fnext; int i = i_, inext; do { find_next(f, i, fnext, inext); f = fnext; i = inext; } while ( vda_->dual().is_infinite(f, i) ); return Halfedge_handle( Self(vda_, f, i) ); } Halfedge_handle previous() const { if ( vda_->dual().dimension() == 1 ) { return Halfedge_handle( find_next_1D() ); } Delaunay_face_handle f, fprev = f_; int iprev = i_, i; // if I want to return also infinite edges replace the test in // the while loop by the following test (i.e., should omit the // testing for infinity): // vda_->edge_rejector()(vda_->dual(), f, i) do { f = fprev->neighbor(iprev); int i_mirror = vda_->dual().tds().mirror_index(fprev, iprev); i = CW_CCW_2::ccw( i_mirror ); fprev = f; iprev = i; } while ( vda_->edge_rejector()(vda_->dual(), f, i) || vda_->dual().is_infinite(f, i) ); return Halfedge_handle( Self(vda_, f, i) ); } Vertex_handle source() const { CGAL_precondition( has_source() ); return opposite()->target(); } Vertex_handle target() const { CGAL_precondition( has_target() ); Delaunay_face_handle fvalid = Find_valid_vertex()(vda_, f_); CGAL_assertion( !vda_->dual().is_infinite(fvalid) ); return Vertex_handle( Vertex(vda_, fvalid) ); } Face_handle face() const { if ( vda_->dual().dimension() == 1 ) { return Face_handle( Face(vda_, v1_) ); } Face f(vda_, f_->vertex( CW_CCW_2::ccw(i_) )); return Face_handle(f); // Face_handle( Face(vda_, f_->vertex( CW_CCW_2::ccw(i_) )) ); } Ccb_halfedge_circulator ccb() const { return Ccb_halfedge_circulator( *this ); } // PREDICATES //----------- bool has_source() const { return opposite()->has_target(); } bool has_target() const { if ( vda_->dual().dimension() == 1 ) { return false; } return !vda_->dual().is_infinite(f_); } bool is_unbounded() const { return !has_source() || !has_target(); } bool is_bisector() const { return !has_source() && !has_target(); } bool is_segment() const { return has_source() && has_target(); } bool is_ray() const { return ( has_source() && !has_target() ) || ( !has_source() && has_target() ); } // ACCESS TO DUAL DEFINING VERTICES //--------------------------------- Delaunay_vertex_handle up() const { if ( vda_->dual().dimension() == 1 ) { return v1_; } return f_->vertex( CW_CCW_2::ccw(i_) ); } Delaunay_vertex_handle down() const { if ( vda_->dual().dimension() == 1 ) { return v2_; } return f_->vertex( CW_CCW_2::cw(i_) ); } Delaunay_vertex_handle left() const { CGAL_precondition( has_source() ); return vda_->dual().tds().mirror_vertex(f_,i_); } Delaunay_vertex_handle right() const { CGAL_precondition( has_target() ); return f_->vertex( i_ ); } // DUAL FEATURE //------------- Delaunay_edge dual() const { if ( vda_->dual().dimension() == 1 ) { Delaunay_edge_circulator ec; if ( vda_->dual().is_infinite(v1_) ) { CGAL_assertion( !vda_->dual().is_infinite(v2_) ); ec = vda_->dual().incident_edges(v2_); } else { ec = vda_->dual().incident_edges(v1_); } do { Delaunay_edge e = *ec; if ( (e.first->vertex(0) == v1_ && e.first->vertex(1) == v2_) || (e.first->vertex(0) == v2_ && e.first->vertex(1) == v1_) ) { return e; } ++ec; } while ( true ); } else { return Delaunay_edge(f_, i_); } } // VALIDITY TESTING //----------------- bool is_valid() const { if ( vda_ == nullptr ) { return true; } bool valid = true; if ( vda_->dual().dimension() == 1 ) { valid = valid && v1_ != Delaunay_vertex_handle(); valid = valid && v2_ != Delaunay_vertex_handle(); } else { valid = valid && !vda_->edge_rejector()(vda_->dual(), f_, i_); Delaunay_vertex_handle v = f_->vertex( CW_CCW_2::ccw(i_) ); valid = valid && !vda_->face_rejector()(vda_->dual(), v); } Halfedge_handle h_this(*this); valid = valid && opposite()->opposite() == h_this; if ( has_source() ) { valid = valid && source()->is_valid(); valid = valid && source()->is_incident_edge( h_this ); } if ( has_target() ) { valid = valid && target()->is_valid(); valid = valid && target()->is_incident_edge( h_this ); } valid = valid && next()->previous() == h_this; valid = valid && previous()->next() == h_this; return valid; } // COMPARISON OPERATORS //--------------------- bool operator==(const Self& other) const { if ( vda_ == nullptr ) { return other.vda_ == nullptr; } if ( other.vda_ == nullptr ) { return vda_ == nullptr; } if ( vda_->dual().dimension() == 1 ) { return ( vda_ == other.vda_ && v1_ == other.v1_ && v2_ == other.v2_ ); } else { return ( vda_ == other.vda_ && f_ == other.f_ && i_ == other.i_ ); } } bool operator!=(const Self& other) const { return !((*this) == other); } bool operator<(const Self& other) const { if ( vda_ == nullptr ) { return other.vda_ != nullptr; } if ( other.vda_ == nullptr ) { return false; } if ( vda_ != other.vda_ ) { return vda_ < other.vda_; } if ( vda_->dual().dimension() == 1 ) { if ( v1_ != other.v1_ ) { return v1_ < other.v1_; } return v2_ < other.v2_; } else { if ( f_ != other.f_ ) { return f_ < other.f_; } return i_ < other.i_; } } private: const VDA* vda_; Delaunay_face_handle f_; int i_; Delaunay_vertex_handle v1_, v2_; }; } } //namespace VoronoiDiagram_2::Internal } //namespace CGAL //========================================================================= //========================================================================= #endif // CGAL_VORONOI_DIAGRAM_2_HALFEDGE_2_H