Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] efficiency of a O(n^2) algorithm

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] efficiency of a O(n^2) algorithm


Chronological Thread 
  • From: Ben Supnik <>
  • To:
  • Subject: Re: [cgal-discuss] efficiency of a O(n^2) algorithm
  • Date: Thu, 05 Nov 2009 14:52:29 -0500

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
ben

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 Home Page: http://scenery.x-plane.com/
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:




Archive powered by MHonArc 2.6.16.

Top of Page