Subject: CGAL users discussion list
List archive
- From: <>
- To: cgal <>
- Subject: RE: [cgal-discuss] Convex_hull_d performance
- Date: Mon, 24 Nov 2008 20:40:52 +0000
- Importance: Normal
I should warn you though that qhull isn't exactly user friendly. It's not designed to be used as an API as far as I know, just as an executable. If you do find a proper way to use it, directly in code or any other convex hull program that's quick and has decent output, please drop me a line, thanks. > Date: Mon, 24 Nov 2008 16:54:44 -0300 > From: > To: > Subject: Re: [cgal-discuss] Convex_hull_d performance > > Thank you! > I will try qhull. :-) > > On Mon, Nov 24, 2008 at 3:44 PM, <> wrote: > > I had the same issue. I needed to compute the convex hull of a set of points > > on a sphere. > > > > This may not work for you, but I ended up using the triangulation routine > > after which I only consider infinite cells. > > > > I can't quote exact numbers, but the convex hull algorithm performed very > > poorly on my machine (in the order of hundreds of ms for perhaps 100 > > points?). I tried qhull, which did the same number of points in mere > > milliseconds. > > > > The triangulation takes about 20ms for 50-100 points and what's more, it > > supports insertion as well as deletion of points. > > > >> To: > >> From: > >> Date: Mon, 24 Nov 2008 17:31:19 +0100 > >> Subject: [cgal-discuss] Convex_hull_d performance > >> > >> Dear all, > >> > >> I am using CGAL::Convex_hull_d to compute the convex hull of a small set > >> of > >> points in some n-dimensional space. Here, small means 2*n points, where n > >> is > >> the number of dimensions of the space (3 <= n <= 6). Unfortunately, > >> compute the > >> convex hull is the bottleneck of my implementation. Actually, the program > >> spends 87% of the time calling CGAL::Convex_hull_d.insert(). > >> > >> Today, my implementation takes several minutes to process simple data sets > >> and > >> I want to make it run faster. My question is: There is some trick that I > >> can > >> use to improve CGAL's performance assuming a small number of input points? > >> I > >> believe that the bottleneck inside CGAL is memory allocation.-- > >> You are currently subscribed to cgal-discuss. > >> To unsubscribe or access the archives, go to > >> https://lists-sop.inria.fr/wws/info/cgal-discuss > > > > > > ________________________________ > > Vanaf nu heb je je vrienden overal bij! Messenger voor Mobile > > > > -- > Leandro Augusto Frata Fernandes > > http://www.inf.ufrgs.br/~laffernandes > Porto Alegre - RS > > "A computer lets you make more mistakes faster than any invention in > human history - with the possible exceptions of handguns and tequila" > -- > You are currently subscribed to cgal-discuss. > To unsubscribe or access the archives, go to > https://lists-sop.inria.fr/wws/info/cgal-discuss De nieuwe Hotmail maakt je leven nog makkelijker Wees er als eerste bij. |
- [cgal-discuss] Convex_hull_d performance, laffernandes, 11/24/2008
- Re: [cgal-discuss] Convex_hull_d performance, Bernd Gaertner, 11/24/2008
- Re: Re: [cgal-discuss] Convex_hull_d performance, laffernandes, 11/24/2008
- Re: [cgal-discuss] Convex_hull_d performance, Camille Wormser, 11/24/2008
- RE: [cgal-discuss] Convex_hull_d performance, pgoeleven, 11/24/2008
- Re: [cgal-discuss] Convex_hull_d performance, Leandro Augusto Frata Fernandes, 11/24/2008
- RE: [cgal-discuss] Convex_hull_d performance, pgoeleven, 11/24/2008
- Re: [cgal-discuss] Convex_hull_d performance, Leandro Augusto Frata Fernandes, 11/24/2008
- Re: [cgal-discuss] Convex_hull_d performance, Bernd Gaertner, 11/24/2008
Archive powered by MHonArc 2.6.16.