svd_orientation_c2.h

来自「CGAL is a collaborative effort of severa」· C头文件 代码 · 共 181 行

H
181
字号
// Copyright (c) 2003,2004  INRIA Sophia-Antipolis (France) and// Notre Dame University (U.S.A.).  All rights reserved.//// This file is part of CGAL (www.cgal.org); you may redistribute it under// the terms of the Q Public License version 1.0.// See the file LICENSE.QPL distributed with CGAL.//// Licensees holding a valid commercial license may use this file in// accordance with the commercial license agreement provided with the software.//// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.//// $Source: /CVSROOT/CGAL/Packages/Segment_Voronoi_diagram_2/include/CGAL/predicates/Svd_orientation_C2.h,v $// $Revision: 1.4 $ $Date: 2004/07/08 16:58:03 $// $Name:  $//// Author(s)     : Menelaos Karavelas <mkaravel@cse.nd.edu>#ifndef CGAL_SVD_ORIENTATION_C2_H#define CGAL_SVD_ORIENTATION_C2_H#include <CGAL/predicates/Svd_basic_predicates_C2.h>#include <CGAL/predicates/Svd_are_same_points_C2.h>#include <CGAL/predicates/Svd_are_same_segments_C2.h>CGAL_BEGIN_NAMESPACE//-----------------------------------------------------------------------------template<class K>class Svd_orientation_C2  : public Svd_basic_predicates_C2<K>{private:  typedef Svd_basic_predicates_C2<K>          Base;    typedef typename Base::Point_2              Point_2;  typedef typename Base::Segment_2            Segment_2;  typedef typename Base::Site_2               Site_2;  typedef typename Base::FT                   FT;  typedef typename Base::RT                   RT;  typedef typename K::Kernel::Orientation_2   Orientation_2;  typedef CGAL::Svd_are_same_points_C2<K>     Are_same_points_2;  typedef CGAL::Svd_are_same_segments_C2<K>   Are_same_segments_2;  typedef typename K::Intersections_tag       ITag;  Are_same_points_2    same_points;  Are_same_segments_2  same_segments;  bool have_common_support(const Site_2& p, const Site_2& q) const  {    CGAL_precondition( !p.is_input() && !q.is_input() );    return      same_segments(p.supporting_site(0), q.supporting_site(0)) ||      same_segments(p.supporting_site(0), q.supporting_site(1)) ||      same_segments(p.supporting_site(1), q.supporting_site(0)) ||      same_segments(p.supporting_site(1), q.supporting_site(1));  }  bool have_common_support(const Site_2& p, const Site_2& q,			   Site_2& support) const  {    CGAL_precondition( !p.is_input() && !q.is_input() );    if ( same_segments(p.supporting_site(0),		       q.supporting_site(0)) ||	 same_segments(p.supporting_site(0),		       q.supporting_site(1)) ) {      support = p.supporting_site(0);      return true;    } else if ( same_segments(p.supporting_site(1),			      q.supporting_site(0)) ||		same_segments(p.supporting_site(1),			      q.supporting_site(1)) ) {      support =  p.supporting_site(1);      return true;    }    return false;  }  bool is_endpoint(const Site_2& p, const Site_2& s) const  {    return same_points(s.source_site(), p) ||      same_points(s.target_site(), p);  }  //-------------------------------------------------------------  Orientation predicate(const Site_2& p, const Site_2& q,			const Site_2& r, const Tag_false&) const  {    return Orientation_2()(p.point(), q.point(), r.point());  }  Orientation predicate(const Site_2& p, const Site_2& q,			const Site_2& r, const Tag_true&) const  {#if 1    // do geometric filtering    bool pe = p.is_input();    bool qe = q.is_input();    bool re = r.is_input();    Site_2 support;    if ( !pe && !qe && !re ) {      if ( have_common_support(p, q, support) &&	   have_common_support(support, r) ) {	return COLLINEAR;      }    } else if ( !pe && !qe ) {      if ( have_common_support(p, q, support) &&	   is_endpoint(r, support) ) {	return COLLINEAR;      }    } else if ( !pe && !re ) {      if ( have_common_support(p, r, support) &&	   is_endpoint(q, support) ) {	return COLLINEAR;      }    } else if ( !qe && !re ) {      if ( have_common_support(q, r, support) &&	   is_endpoint(p, support) ) {	return COLLINEAR;      }    } else if ( !pe ) {      Site_2 s0 = p.supporting_site(0);      Site_2 s1 = p.supporting_site(1);      if ( (is_endpoint(q, s0) && is_endpoint(r, s0)) ||	   (is_endpoint(q, s1) && is_endpoint(r, s1)) ) {	return COLLINEAR;      }    } else if ( !qe ) {      Site_2 s0 = q.supporting_site(0);      Site_2 s1 = q.supporting_site(1);      if ( (is_endpoint(p, s0) && is_endpoint(r, s0)) ||	   (is_endpoint(p, s1) && is_endpoint(r, s1)) ) {	return COLLINEAR;      }    } else if ( !re ) {      Site_2 s0 = r.supporting_site(0);      Site_2 s1 = r.supporting_site(1);      if ( (is_endpoint(q, s0) && is_endpoint(p, s0)) ||	   (is_endpoint(q, s1) && is_endpoint(p, s1)) ) {	return COLLINEAR;      }    }#endif    return predicate(p, q, r, Tag_false());  }public:  typedef Orientation             result_type;  typedef Site_2                  argument_type;  typedef Arity_tag<3>            Arity;  Orientation operator()(const Site_2& p, const Site_2& q,			 const Site_2& r) const  {    CGAL_precondition( p.is_point() && q.is_point() && r.is_point() );    return predicate(p, q, r, ITag());  }};//-----------------------------------------------------------------------------CGAL_END_NAMESPACE#endif // CGAL_SVD_ORIENTATION_C2_H

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?