Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] The Problem in calculate the intersection of two X_monotone_curve_2

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] The Problem in calculate the intersection of two X_monotone_curve_2


Chronological Thread 
  • From: zickphy <>
  • To:
  • Subject: Re: [cgal-discuss] The Problem in calculate the intersection of two X_monotone_curve_2
  • Date: Thu, 15 Oct 2009 15:34:46 -0700 (PDT)


I changed code, but it still has problems...

-------------------------------
Conic_arc_2 arclist[] = {arc1, arc2};
std::list<CGAL::Object> ptlist;
Conic_traits_2 traits;
Conic_arc_2 arc1(0,0,0,0,0,0,CGAL::COUNTERCLOCKWISE, Query_Point_2(4,1),
Query_Point_2(6,1));
Conic_arc_2 arc2(0,0,0,0,0,0,CGAL::COUNTERCLOCKWISE, Query_Point_2(5,2),
Query_Point_2(5,0));
CGAL::compute_intersection_points(curlist, curlist+2,
std::back_inserter(ptlist), false, traits);

--------------------------------
The compile error is that:
1>d:\cgal-3.5-beta1\include\cgal\sweep_line_2\sweep_line_2_utils.h(66) :
error C2243: “Type Conversion”: From “monotone_curve_2 *__w64 ”到“const
CGAL::_Conic_arc_2<Rat_kernel_,Alg_kernel_,Nt_traits_> &” Conversion exists,
but can not access
1> with
1> [
1> Rat_kernel_=CGAL::Cartesian<Rational>,
1> Alg_kernel_=CGAL::Cartesian<Algebraic>,
1> Nt_traits_=CGAL::CORE_algebraic_number_traits
1> ]
1>
d:\cgal-3.5-beta1\include\cgal\sweep_line_2\sweep_line_2_visitors.h(87):
参见对正在编译的函数 模板 实例化“void
CGAL::make_x_monotone<CGAL::Arr_conic_traits_2<Rat_kernel_,Alg_kernel_,Nt_traits_>,CurveIterator,std::back_insert_iterator<_Container>,std::back_insert_iterator<std::vector<_Ty>>>(CurveInputIter,CurveInputIter,XCurveOutIter,PointOutIter,const
Traits *)”的引用
1> with
1> [
1> Rat_kernel_=Rat_kernel,
1> Alg_kernel_=Alg_kernel,
1> Nt_traits_=Nt_traits,
1> CurveIterator=monotone_curve_2 *,
1>
_Container=std::vector<CGAL::_Conic_x_monotone_arc_2<CGAL::_Conic_arc_2<CGAL::Cartesian<Rational>,CGAL::Cartesian<Algebraic>,CGAL::CORE_algebraic_number_traits>>>,
1> _Ty=CGAL::_Conic_point_2<CGAL::Cartesian<Algebraic>>,
1> CurveInputIter=monotone_curve_2 *,
1>
XCurveOutIter=std::back_insert_iterator<std::vector<CGAL::_Conic_x_monotone_arc_2<CGAL::_Conic_arc_2<CGAL::Cartesian<Rational>,CGAL::Cartesian<Algebraic>,CGAL::CORE_algebraic_number_traits>>>>,
1>
PointOutIter=std::back_insert_iterator<std::vector<CGAL::_Conic_point_2<CGAL::Cartesian<Algebraic>>>>,
1>
Traits=CGAL::Arr_conic_traits_2<Rat_kernel,Alg_kernel,Nt_traits>
1> ]
1> d:\cgal-3.5-beta1\include\cgal\sweep_line_2_algorithms.h(121):
参见对正在编译的函数 模板 实例化“void
CGAL::Sweep_line_points_visitor<Traits_,OutputIerator_>::sweep<CurveInputIterator>(CurveIterator,CurveIterator)”的引用
1> with
1> [
1> Traits_=Conic_traits_2,
1>
OutputIerator_=std::back_insert_iterator<std::list<CGAL::Object>>,
1> CurveInputIterator=monotone_curve_2 *,
1> CurveIterator=monotone_curve_2 *
1> ]
1> c:\users\user\desktop\vcprg\cgaldemo\cgaldemo.cpp(221): 参见对正在编译的函数
模板 实例化“OutputIterator
CGAL::compute_intersection_points<monotone_curve_2*,std::back_insert_iterator<_Container>,Conic_traits_2>(CurveInputIterator,CurveInputIterator,OutputIterator,bool,Traits
&)”的引用
1> with
1> [
1>
OutputIterator=std::back_insert_iterator<std::list<CGAL::Object>>,
1> _Container=std::list<CGAL::Object>,
1> CurveInputIterator=monotone_curve_2 *,
1> Traits=Conic_traits_2
1> ]
--
View this message in context:
http://www.nabble.com/The-Problem-in-calculate-the-intersection-of-two-X_monotone_curve_2-tp25740486p25917053.html
Sent from the cgal-discuss mailing list archive at Nabble.com.




Archive powered by MHonArc 2.6.16.

Top of Page