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

Subject: CGAL users discussion list

List archive

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

--
Sylvain Pion
INRIA Sophia-Antipolis
Geometrica Project-Team
CGAL, http://cgal.org/

[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