#19583: random triangulation as simplicial complex
-------------------------------------+-------------------------------------
Reporter: chapoton | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.10
Component: algebraic | Resolution:
topology | Merged in:
Keywords: random simplicial | Reviewers:
complex | Work issues:
Authors: Frédéric Chapoton | Commit:
Report Upstream: N/A | 9bfcd88d9195f90369905ee2243e9e888ce22af6
Branch: u/chapoton/19583 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by chapoton):
* modifying the code in #19520 to manage the embedding seems difficult (by
the lack of a proper class for planar graphs, as I have said before). I
would love to, and maybe will need too, but this will be hard.
* the 'is_planar' is much too slow, and is in fact re-building by brute
force the embedding we should already know.
* one option would be to drop the code in #19520 and get the edge graph
from the code here. I would prefer no too. This is just a little code
duplication, do you really mind ?
* I still have other projects in the same vein..
--
Ticket URL: <http://trac.sagemath.org/ticket/19583#comment:9>
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.
