Does anyone have practical experience and recommendations concerning the
speed difference between the qhull algorithm/library and others?
I am looking for the fastest free library able to compute voronoi and
delaunay on a small set (<100) of nodes in high dimensions (~7 to 13).
"When to use qhull" says:
Do you have any knowledge at which point cdd becomes faster than qhull?Quote:> If your problem is in high dimensions with a few, non-simplicial facets,
> try Fukuda's cdd. It is much faster than Qhull for these distributions.
I know that qhull is unwilling to compute more than 9d diagrams due to
Thank you in advance for all comments, help or pointers to interesting
key print: 4382 395A 6954 D96A CC58 4C31 5A3D 0901 C933 BD8C