#18860: Faster Poyhedron.graph()
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: new
Type: | Milestone: sage-6.8
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
geometry | Work issues:
Keywords: | Commit:
Authors: | 3b5eabb9735a867678c2c6a13dc7700c24d82732
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18860 |
Dependencies: |
#18779 |
-------------------------+-------------------------------------------------
Changes (by dimpase):
* cc: novoselt (added)
Comment:
Replying to [comment:5 ncohen]:
> > General code for adjacency of two vertices `a` and `b` of a polytope
in `d`-dimensional space
> > should check that `m` has corank `1`.
>
> Would you know how to adapt this code for that? Hoping that it will
remain faster than what we currently have?
My understanding is that hacking `hasse_diagram.py` to stop earlier is
what one actually needs to do.
Except that it goes from bottom to top, which probably means that one gets
adjacency of facets as the first step. But it should be possible to change
it that goes the other way around.
We can write a paper about it ;-).
--
Ticket URL: <http://trac.sagemath.org/ticket/18860#comment:6>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
