CGAL users discussion list

[Efraim Fogel <>]

I wasn't able to reproduce the problem with CGAL 3.5.

Make sure you are using a kernel with exact predicates and exact
constructions. If the problem remains, send the code of a small program
that causes it.

BBB HHH wrote:
> Hello,
>
> Attached to this e-mail, you can find the .dat files storing the
> polygns i am working with (file first_polygon.dat and files
> polygon_00.dat to polygon_15.dat). I also attached .off files storing
> the same polygons so you can visualize them.
>
> Thanks
> Hichem
>
> ------------------------------------------------------------------------
> *De :* 
> ""
>  
> <>
> *À :* 
> 
> *Envoyé le :* Samedi, 26 Septembre 2009, 16h24mn 57s
> *Objet :* Re: [cgal-discuss] An error when trying to compute
> intersection of polygons
>
> So you are trying to compute the intersection between 'first_polygon'
> and all the polygons in the range 'polygons.begin(), polygons.end()'.
> Could you please provide the data that causes the problem. It would be
> nice if you narrow it down first.
>
> Quoting "BBB HHH" 
> <
>  
> <mailto:>>:
>
> > Hello,
> >
> > I am trying to compute the intersection of some polygons in 2D. For
> that purpose, i am using the 2D Regularized Boolean Set-Operations of
> CGAL 3.4. I am also using VS2005 under Windows XP SP3.
> >
> > For some polygons which seemto be correct (CCW orientation,
> non-degenerate, simple, bounded), i have the following error:
> >
> > CGAL error: precondition violation!
> > Expression : cv.is_in_x_range (p)
> > File      : c:\program
> files\cgal-3.4-beta1\include\cgal\arr_segment_traits_2.h
> >
> > Line      : 481
> > Explanation:
> > Refer to the bug-reporting instructions at
> http://www.cgal.org/bug_report.html
> >
> >
> > I am using an exact kernel
> (CGAL::Simple_cartesian<CGAL::Lazy_exact_nt<Gmpq> >). The problematic
> line of code is that computing the intersection of some polygons
> >
> > std::vector<Polygon_2>        polygons;
> > // Fill the list of polygons
> > // Initialize the polygon set with a polygon
> > Polygon_set_2 S(first_polygon);
> > S.intersection(polygons.begin(), polygons.end());
> >
> > Thanks in advance for your help
> > Hichem Barki
> >
> >
> >
> >      --
> > You are currently subscribed to cgal-discuss.
> > To unsubscribe or access the archives, go to
> > https://lists-sop.inria.fr/wws/info/cgal-discuss
> >
>
>
> --You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>
-- 
  ____  _        ____             _
 /_____/_) o    /__________  __  //
(____ (   (    (    (_/ (_/-(-'_(/
                        _/