2020-05-12 15:23:07 +0200 received badge ● Popular Question (source) 2017-12-10 11:15:05 +0200 received badge ● Nice Question (source) 2017-12-10 02:36:32 +0200 received badge ● Editor (source) 2017-12-06 02:44:49 +0200 commented question cartesian product polyhedra The question is asking if there is any reference for the computation that Sage is making. 2017-12-05 19:30:21 +0200 received badge ● Student (source) 2017-12-05 16:10:35 +0200 asked a question cartesian product polyhedra Are there any book or paper citations on how the Cartesian product of polyhedra is computed within the polyhedron base class? Consider the following example input: P1 = Polyhedron(vertices = [[1,1], [2,3], [3,0]], rays = [[3,2], [5,2]]) P2 = Polyhedron(vertices = [[6,0]], rays = [[1,9], [1,3]]) ExampleP = P1.product(P2) ExampleP.Vrepresentation()  The output is: A ray in the direction (0, 0, 1, 3), A ray in the direction (0, 0, 1, 9), A vertex at (1, 1, 6, 0), A vertex at (2, 3, 6, 0), A vertex at (3, 0, 6, 0), A ray in the direction (3, 2, 0, 0), A ray in the direction (5, 2, 0, 0)