-
-
Notifications
You must be signed in to change notification settings - Fork 453
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
Compute graph of polyhedron with CombinatorialPolyhedron #28626
Comments
Branch: public/28626 |
Changed keywords from none to polyhedron, combinatorial_polyhedron |
Commit: |
comment:2
What do we do with polyhedra that contain lines? As of now it is understood that in this case the vertex_graph is non-empty. So the vertex graph is basically the one of the projection. However, the docstring of If people think this is the way it should be than the docstring of I stumbled upon this because I got a test failure at
This is a weird test, as it tests a behavior which seems to be opposed to the intention of New commits:
|
comment:3
it is not clear from the ticket description why edge_graph is deprecated, can you explain? |
comment:4
Sorry about the confusion. This ticket is built on top of #28603 and #28621. Only the last commit is due to this ticket. In This way There are two issues with edge graph:
polyhedra do not have isomorphic |
comment:5
So this does bring the sanity in, where vertices correspond to vertices in the geometric sense, right? |
comment:6
Yes. However, as I'm changing the behavior, I didn't want to do it secretely and see if there are objections. Hence the post on sage_devel. |
Reviewer: Dima Pasechnik |
comment:7
Are you still working on the ticket, or it needs review? |
comment:8
I mostly waited, if there where objections to changing the behavior. If there are none, I need to change the failing test and probably comment on the vertices being different from the method |
This comment has been minimized.
This comment has been minimized.
comment:12
Ticket retargeted after milestone closed |
comment:13
Is this ticket good to go? |
comment:14
How about the bot report:
|
comment:15
Replying to @dimpase:
Fixed in #28880. |
comment:16
Batch modifying tickets that will likely not be ready for 9.1, based on a review of the ticket title, branch/review status, and last modification date. |
comment:17
Replying to @kliem:
Could you link to the post? I would say that the ticket looks ready, but for the sake of completeness, I would like to check the change of behavior... |
Changed reviewer from Dima Pasechnik to Dima Pasechnik, Jean-Philippe Labbé |
This comment has been minimized.
This comment has been minimized.
comment:20
Thank you. |
Changed branch from public/28626 to |
We use
CombinatorialPolyhedron
to compute the graph ofPolyhedron_base
.In the case of polyhedra with
lines
aka unpointed polyhedra this changes the behavior:have the same graph (assuming the Vrepresentation as
['my_vertices', 'my_rays', 'my_lines']
is minimal).We add information about this to the documentation of
vertex_graph
.We alter a doctest in
combinatorial_automorphism_group
that assumed the old behavior.See https://groups.google.com/d/msg/sage-devel/lTwb_P0nBEw/_R4vXOxgDAAJ for the discussion of this change.
Depends on #28621
Depends on #28603
CC: @jplab @LaisRast
Component: geometry
Keywords: polyhedron, combinatorial_polyhedron
Author: Jonathan Kliem
Branch/Commit:
01d1907
Reviewer: Dima Pasechnik, Jean-Philippe Labbé
Issue created by migration from https://trac.sagemath.org/ticket/28626
The text was updated successfully, but these errors were encountered: