Subject: CGAL users discussion list
List archive
- From: Bernd Gaertner <>
- To:
- Subject: Re: [cgal-discuss] DelaunayD Class
- Date: Thu, 28 Jun 2007 09:23:55 +0200
wrote:
2) I have to compute Delaunay triangulations of N points in D dimensions. It seems that the overall complexity of DelaunayD class is O(N^{D/2}) to that purpose. Is it correct ?
Yes, this is the worst-case complexity; in many practical situations
it will be much faster, though.
Best,
Bernd.
- DelaunayD Class, jeanmarc . mercier, 06/28/2007
- Re: [cgal-discuss] DelaunayD Class, Andreas Fabri, 06/28/2007
- Re: [cgal-discuss] DelaunayD Class, Bernd Gaertner, 06/28/2007
Archive powered by MHonArc 2.6.16.