-
-
Notifications
You must be signed in to change notification settings - Fork 512
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
More direct check for simple/simplicial polytopes #30428
Milestone
Comments
Branch: public/30428 |
Commit: |
New commits:
|
comment:5
LGTM. |
Reviewer: Travis Scrimshaw |
comment:6
Thanks. |
Changed branch from public/30428 to |
This was referenced Nov 15, 2020
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
We simplify checking for whether a polyhedron is simple or simplicial by just counting the number of set bits in the vertices/facets.
CC: @jplab @LaisRast @tscrim
Component: geometry
Keywords: simple, simplicial, combinatorial polyheddron
Author: Jonathan Kliem
Branch/Commit:
39f3a38
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/30428
The text was updated successfully, but these errors were encountered: