id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
27987,"CombinatorialPolyhedron improve initialization, remove bug for unbounded polyhedra",gh-kliem,,"`CombinatorialPolyhedron` as of #26887 only requires the number of lines (as `n_lines` in `Polyhedron_base`). This does not suffice, as
{{{
sage: P1 = Polyhedron(vertices=[[0,1],[1,0]], rays=[[1,1]])
sage: P2 = Polyhedron(vertices=[[0,1],[1,0],[1,1]])
sage: P1.incidence_matrix() == P2.incidence_matrix()
True
}}}
Instead of just specifying the `n_lines`, one should specify `unbounded` and a far face.
Unfortunately, determining the rays from just the incidence matrix does not seem to work.
Now with the far face at hand anyway, it's much easier to determine the (combinatorial) vertices.",defect,closed,major,sage-8.9,geometry,fixed,,jipilab tscrim vdelecroix,,Jonathan Kliem,Travis Scrimshaw,N/A,,806a217944c9332ec3e09f153cbd589075d0fa0f,806a217944c9332ec3e09f153cbd589075d0fa0f,,