On 2015-02-11, Nathann Cohen <[email protected]> wrote: > Yo ! > >> I don't know if PPL does any of these. > > There is a sage.libs.ppl.C_Polyhedron.minimized_generators function Is it incremental? (I.e., can it stop early, encountering a non-convex-hull point?)
> >> If it does not, >> I'd suggest using CGAL, where these things work quite well, although it's a >> bit of a pain. >> (mostly due to its size, and dependence on advanced C++ features). > > Interfacing Sage and CGAL is a crazy amount of work. Understanding how > CGAL works would be a crazy amount of work already :-P Don't expect much sanity from me :-) I used to have an idea how CGAL works, it's not really that crazy - adding more code to CGAL is hard, but using it is not... Dima > > Nathann > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
