That should work. As I said, I only use bounded polytopes so some of my code is badly vertex-oriented.
You can submit a patch as above and I will review it. It is good to have relatively small patches since they are easier to test. I saw I just missed you on IRC, I am usually logged in but not always at the keyboard. I should be there for a while in a couple of hours. -Marshall On Dec 12, 11:12 am, "Sébastien Barthélemy" <sebastien.barthel...@gmail.com> wrote: > Yet another question: see no reason why unbounded polyhedra are not > handled by mink_sum() > > def mink_sum(polyhedra_list, verbose = False): > """ > Returns the Minkowski sum of a list of polyhedra. > TODO: currently only works for polytopes, not unbounded polyhedra > """ > > Currently, the vertices of the sum are computed this way: > > answer = Polyhedron() > temp_vertex_list = [] > for vertex1 in polyhedra_list[0].vertices(): > for vertex2 in polyhedra_list[1].vertices(): > temp_vertex_list.append([vertex1[i]+vertex2[i] for i in > range(len(vertex1))]) > answer._vertices = temp_vertex_list > answer._remove_redundant_vertices() > > adding > > answer._rays.append(polyhedra_list[0].rays()) > answer._rays.append(polyhedra_list[1].rays()) > > should be correct. a call to _remove_redundant_rays_and_vertices() > should be called after, I'll see if cdd has this functionality. > -- > Sébastien Barthélemy --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
