Subject: CGAL users discussion list
List archive
- From: Marco Aurelio Sterpa <>
- To:
- Subject: Re: [cgal-discuss] efficiency of a O(n^2) algorithm
- Date: Thu, 5 Nov 2009 21:00:08 +0100
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type; b=xJpHvrNMkopFhH1yfoc1RZ6UhweZkWuu+Hk+HNy/LE/V+/cAbJ5YpC1lA1q3NNLsrn CFYPYJuVFM9NjMQE7QaMrF0JNjvw//ScUUk4A7/8KeQWgNPLuDqkQ/KHr5Bu0ggpDssp APh/+8A3tY+rMDQvu3Z097n+mlFFIeey302Bo=
Hi Ben,
I thought that when I read your answer eheh, anyway I reduce a little bit the overall running time but just modifying some function, from a general-purpose library kind to a more specific and less reusable ones. This is not a good thing, but I need to get improvement in a few days cause I have to finish my bachelor thesis. I thank you for your time, best regards,
Marco
2009/11/5 Ben Supnik <>
LOL -- I still have hope!!!
Sorry, what I meant to write was: "I don't think any of the kernels have SLOWER than constanttime operation".
Sylvain: in the case of some of the lazy kernels is it possible that time performance of the whole algorithm could be improved by the reduction of entire sets of geometric or numeric operations that can be eliminated when the DAG is evaluated?
Of course...if this was possible, the algorithm running on top of the kernel would be rather poorly written.
Still, I am excited for the wonderful future of sub-constant time operations. :-)
cheers
benScenery Home Page: http://scenery.x-plane.com/
Sylvain Pion wrote:
Ben Supnik a écrit :
I don't think any of the kernels have faster than constant-time operations but I am not sure about this.
Well, believe me, I really tried hard, but so far I failed ;-)
--
Scenery blog: http://xplanescenery.blogspot.com/
Plugin SDK: http://www.xsquawkbox.net/xpsdk/
X-Plane Wiki: http://wiki.x-plane.com/
Scenery mailing list:
Developer mailing list:
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss
- [cgal-discuss] efficiency of a O(n^2) algorithm, Sterpa, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Ben Supnik, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Marco Aurelio Sterpa, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Ben Supnik, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Marco Aurelio Sterpa, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Ben Supnik, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Sylvain Pion, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Ben Supnik, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Marco Aurelio Sterpa, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Sylvain Pion, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Marco Aurelio Sterpa, 11/06/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Sylvain Pion, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Ben Supnik, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Marco Aurelio Sterpa, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Ben Supnik, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Marco Aurelio Sterpa, 11/05/2009
- Re: [cgal-discuss] efficiency of a O(n^2) algorithm, Ben Supnik, 11/05/2009
Archive powered by MHonArc 2.6.16.