-
-
Notifications
You must be signed in to change notification settings - Fork 517
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
Dual for combinatorial polyhedron #29190
Comments
Branch: public/29190 |
Commit: |
comment:2
- * or a tuple consting of facets and vertices as two
+ * or a tuple consisting of facets and vertices as two |
Dependencies: #28608 |
comment:4
I'm just going to wait until #28608 is merged, otherwise it's a pain to review. |
Changed branch from public/29190 to public/29190-reb |
Changed dependencies from #28608 to none |
comment:6
Otherwise, the ticket is good to go. |
This comment has been minimized.
This comment has been minimized.
Reviewer: Laith Rastanawi |
comment:9
I think it is good to go. |
Changed branch from public/29190-reb to |
We implement a method of
CombinatorialPolyhedron
that obtains the polar/dual. We name itdual
and create an aliaspolar
to be consistent withPolyhedron_base
.This is obtained by simply copying and interchanging the bitrepresentation of facets and vertices. The object is purely combinatorial and does not have vertex or facet names. A
ValueError
is raised for the unbounded case.Along the way we implement a
__copy__
method forListOfFaces
and allow initializingCombinatorialPolyhedron
from a tuple consisting of twoListOfFaces
.CC: @jplab @LaisRast
Component: geometry
Keywords: polar, dual, combinatorial polyhedron
Author: Jonathan Kliem
Branch/Commit:
73cf39f
Reviewer: Laith Rastanawi
Issue created by migration from https://trac.sagemath.org/ticket/29190
The text was updated successfully, but these errors were encountered: