CGAL users discussion list

["Atul Thakur" <>]

Hi:

I am able to find out the case in which Min_circle is failing.

Please find the code in the attachment.

thanks,

-Atul

On Thu, Sep 11, 2008 at 10:57 AM, Atul Thakur <> wrote:

I am using visual c++ (ver 8) and currently working in debug mode.

-Atul

On Thu, Sep 11, 2008 at 9:37 AM, Andreas Fabri <> wrote:

Hi Atul,

what compiler do you use and are you in debug or release mode.

andreas

Atul Thakur wrote:

My program is huge and depends on ACIS as well.
I am trying to isolate the part thats crashing. As soon as I am done I'll send you the code.
Thanks for the reply.

-Atul



   On Thu, Sep 11, 2008 at 3:03 AM, Bernd Gaertner

   < <mailto:>> wrote:

       Atul Thakur wrote:

           Hi:
           Still facing the same problem of crashing when I use the
           .Min_circle function of CGAL.


       I'm responsible for this package (sorry for the late reply, I
       was travelling). If you could send me a complete program with
       input that crashes, I will look into it.

       Best,
       Bernd.

       --        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

#include "iostream"
#include "CGAL\Cartesian.h"
#include "CGAL\Point_2.h"
#include "CGAL\Polygon_2.h"
#include "CGAL\config.h"
#include "CGAL\Point_2.h"
#include <CGAL\convex_hull_2.h>
#include <CGAL\Polygon_2.h>
#include <CGAL\Homogeneous.h>
#include <CGAL\Min_circle_2.h>
#include <CGAL\Min_circle_2_traits_2.h>
#include <CGAL\Gmpz.h>   
using namespace std;
typedef CGAL::Cartesian<double> Rep;
typedef CGAL::Point_2<Rep> Point;

typedef CGAL::Polygon_2<Rep> Polygon ;
typedef CGAL::Gmpz NT;
typedef CGAL::Homogeneous<NT> K;
typedef CGAL::Min_circle_2_traits_2<Rep> Traits;
typedef CGAL::Min_circle_2<Traits> Min_circle;   
list <Point> get_data()
{
        list<Point> plist;
        plist.push_back(Point(0, 0.0532667));
        plist.push_back(Point(0.146312, 0.249703));
        plist.push_back(Point(0.297471, 0.452645));
        plist.push_back(Point(0.297471, 0.452645));
        plist.push_back(Point(0.146312, 0.249703));       
        return plist;
}
int main()
{
        
        for (int i=0; i<100; i++)
        {       
                list<Point> ptlist;
                ptlist = get_data();
                Min_circle mc(ptlist.begin(), ptlist.end(), true);
                cout<<mc.circle().squared_radius()<<"\n";
        }
        return 0;
}