id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
28625,Let CombinatorialPolyhedron handle f_vector of polyhedra,gh-kliem,,"`CombinatorialPolyhedron` computes the `f_vector` much faster than the current algorithm. In addition it is very memory efficient.
The goal of this ticket is to replace the method in `Polyhedron_base` by the method in `CombinatorialPolyedron`.
Here is a tiny example of the comparison:
{{{
sage: P = polytopes.permutahedron(6)
sage: _ = P.incidence_matrix()
sage: a = get_memory_usage()
sage: %time P.f_vector()
CPU times: user 8.19 s, sys: 4.46 ms, total: 8.19 s
Wall time: 8.19 s
(1, 720, 1800, 1560, 540, 62, 1)
sage: get_memory_usage(a)
22.84765625
sage: a = get_memory_usage()
sage: C = CombinatorialPolyhedron(P)
sage: %time C.f_vector()
CPU times: user 889 µs, sys: 14 µs, total: 903 µs
Wall time: 905 µs
(1, 720, 1800, 1560, 540, 62, 1)
sage: get_memory_usage(a)
0.81640625
}}}",enhancement,closed,major,sage-9.0,geometry,fixed,,jipilab gh-LaisRast,,Jonathan Kliem,Laith Rastanawi,N/A,,bf85a62865c1a3da76857065169caa7754ba4cd8,bf85a62865c1a3da76857065169caa7754ba4cd8,"#28621, #28607",