On Nov 21, 2007 11:16 AM, mhampton <[EMAIL PROTECTED]> wrote: > > I have a project that I have meant to tackle myself, but I doubt I > will have time to do it for at least a year, so someone can beat me to > it (just let me know!): > > Write a parallellized (DSage!) algorithm/implementation to compute > convex hulls of rational points in n-dimensional space, using exact > arithmetic. My own interest is for polytopes that are highly > degenerate in the sense that the faces are ususally complicated, far > from being simplices. For such polytopes the LRS algorithm doesn't do > too well, although it is fairly easy to parallellize (there is at > least one paper on that topic, but I couldn't find an > implementation). It would be nice to try to parallellize the cdd > program of Fukuda et al - the serial program is already included in > Sage in cddlib (and via polymake). > > I would be interested in corresponding and helping anyone interested.
Could you maybe say a little more about how existing software (e.g., polymake) fails to meet your needs? Is there commercial software that does what you want? Etc., or is this development of something that is in some sense entirely new. Are algorithms for what you want well known and written down in papers or would they have to be invented (thesis!)? William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
