New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Speed up incidence matrix of polyhedra #28643
Comments
Commit: |
New commits:
|
Branch: public/28643 |
This comment has been minimized.
This comment has been minimized.
comment:3
It is faster and still correct.
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:5
You wrote that "The incidence matrix is not unique up to permutation for unbounded polyhedra", I believe you meant something else. Plus, it would be nice to include the following example (which you suggested before). This is an example of two "combinatorially isomorphic" polyhedra with different incidence matrices.
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Reviewer: Laith Rastanawi |
comment:7
I think it is good to go. |
comment:8
May I suggest:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Changed branch from public/28643 to |
We speed up the calculation of the incidence matrix by avoiding recomputation.
The obvious way to implement it, is by doing a nested loop (one loop for
Vrepresentation
, one forHrepresentation
).We do not change this.
However, the inner loop should not recompute things, e.g.
instead call the product of two vectors directly.
Before:
After:
CC: @jplab @LaisRast
Component: geometry
Keywords: polytopes, incidence matrix
Author: Jonathan Kliem
Branch/Commit:
6efb1bc
Reviewer: Laith Rastanawi
Issue created by migration from https://trac.sagemath.org/ticket/28643
The text was updated successfully, but these errors were encountered: