-
Notifications
You must be signed in to change notification settings - Fork 27
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
dim(p) == fulldim(p), but volume(p) gives rank error #224
Comments
bzinberg
added a commit
to bzinberg/Polyhedra.jl
that referenced
this issue
Oct 31, 2020
bzinberg
added a commit
to bzinberg/Polyhedra.jl
that referenced
this issue
Oct 31, 2020
bzinberg
added a commit
to bzinberg/Polyhedra.jl
that referenced
this issue
Oct 31, 2020
bzinberg
added a commit
to bzinberg/Polyhedra.jl
that referenced
this issue
Oct 31, 2020
blegat
pushed a commit
that referenced
this issue
Nov 26, 2020
* Add failing regression test for issue 224 #224 * Attempt to fix issue 224 #224 * Instead of incrementing `depth`, decrement `codim` #228 (comment)
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
In the example below, it looks like one of the simplices that is seen by the iterator in
triangulation
has too few vertices. Shouldn't this be guaranteed not to happen?My immediate blocker is, I don't currently have a way to safely compute the volume of a polyhedron, because the method I'm currently using to detect degeneracy (dim < fulldim) fails here.
To reproduce:
[Edit: More information]
Calling
removevredundancy!(p)
before the call tovolume
does not get rid of the error.The text was updated successfully, but these errors were encountered: