#18860: Faster Poyhedron.graph()
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.8
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
geometry | Work issues:
Keywords: | Commit:
Authors: | 74d8412010748142918edf6178636bffdb14e60a
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18860 |
Dependencies: |
#18779 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
> yes, that's correct for the polytopes - provided there is no redundancy.
Excellent news! Then we have a very nice speedup ahead `:-PPPP`
As for redundancy, it is true that this algorithm will not behave very
well if there are several vertices at the same place which are actually
the same. Redundancy of inequalities, however, is not a problem.
> E.g. if a polytope is not full-dimensional, then adding an equation
satisfied by all the vertices to an inequality is a "copy" of this
inequality, vertex-vise.
Yeah but in terms of sets it produces the very same one. So it's cool.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/18860#comment:20>
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.
