Timeline for algorithms and tools available for a particular polytope computation
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 24, 2017 at 17:20 | comment | added | j.c. | These notes by Madeline Brandt make the good point that polymake might also be slower since it uses rational arithmetic rather than floating-point arithmetic, as qhull does: math.berkeley.edu/~brandtm/talks/polymake.pdf | |
| Mar 24, 2017 at 17:19 | vote | accept | user40780 | ||
| Mar 24, 2017 at 17:19 | comment | added | user40780 | I see. Thank you very much for suggesting polymake to me. I will give it a try :D | |
| Mar 24, 2017 at 17:16 | comment | added | j.c. | @user40780, I'm not sure since I have never used qhull. As you may know, these problems are inherently hard as the dimension gets large. Others might have some ideas if you edit some more details about your cases (typical dimension, number of inequalities, where they come from, etc.) into your question. | |
| Mar 24, 2017 at 17:08 | comment | added | user40780 | Thank you very much, I am currently using qhull. Do you think we have some benchmarks, comparing the speed of qhull and polymake? Thank you very much. I am currently hitting the speed limit of qhull~~ | |
| Mar 24, 2017 at 16:56 | history | answered | j.c. | CC BY-SA 3.0 |