Subject: CGAL users discussion list
List archive
- From: "Chaman Singh Verma" <>
- To:
- Subject: Re: [cgal-discuss] Segment intersection complexity ?
- Date: Tue, 8 Jan 2008 16:42:02 +0530
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:in-reply-to:mime-version:content-type:references; b=C0RUFSfGaGk13SjCn3noGAoiVNtiPqClpmlTrh0iO1oUIhr+GVBFlEOcjLLsFZjERlcYhpLlkC2SfDP3CazEHXvvaHsXuN51el2rrR9nZ79qgOM0jfFe8JjRZ4r/bmvSsD/c7CL806eB4Bk+Vamt/HykS5xn0nqdH3nbGvBilXQ=
Hello,
Yes, It was compiled with Optimization on. The OS is 64 bit OpenSuse.
csv
On Jan 8, 2008 2:03 PM, Andreas Fabri <> wrote:
wrote:Hello,
> Hello,
>
> Can somebody tell me what is the line arrangement complexity ? It looks
> that current CGAL takes anormous amout of time ( > 5 Hours ) for finding
> the intersection points of 10000 segments on 1GB Ram machine.
If everything is so slow, it might be that you do something wrong.
Did you compile in release mode, with optimization switched on?
andreas--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss
- Segment intersection complexity ?, csv610, 01/08/2008
- Re: [cgal-discuss] Segment intersection complexity ?, Andreas Fabri, 01/08/2008
- Re: [cgal-discuss] Segment intersection complexity ?, Chaman Singh Verma, 01/08/2008
- Re: [cgal-discuss] Segment intersection complexity ?, Andreas Fabri, 01/08/2008
Archive powered by MHonArc 2.6.16.