#19583: random triangulation as simplicial complex
-------------------------------------+-------------------------------------
Reporter: chapoton | Owner:
Type: enhancement | Status: needs_review
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 | 95fb7388b2a3e0b35fa8a22e944caa12eb190c33
Branch: u/chapoton/19583 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello,
> I think it would not be easy to manage the embedding in the rotate-and-
close algo. Every single edge addition would have to do a lot of job to do
to change the embedding.
In Sage, the embedding is represented by a list associated to each vertex.
Given the picture have in mind of the algorithm (though perhaps it is
wrong) the algorithm starts from a tree and keeps adding edges, each of
which is, when it is added, on the outer face.
I wonder if when adding edge uv, it does not boil down to adding v at the
end of u's list, and adding u at the beginning of v's list.
And something slightly more specific for a and b.
> ok. If you insist on no-code-duplication, as I said, one can get the
graph from the simplicial complex, maybe at the prize of some (big?) speed
loss.
A big speed loss is a good justification for code duplication.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19583#comment:16>
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.
