#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 chapoton):

 Replying to [comment:10 ncohen]:
 > > * 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.
 >
 > You can easily manage embeddings right now, with get/set_embedding. All
 you need to know is the order of the neighbours of every vertex 'v'. Don't
 we have this information when building the graph?

 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.

 > > * 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 don't mind if there is no way around it, and if there is an easy way
 out I prefer it.

 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.

 > > * I still have other projects in the same vein..
 >
 > Do you plan a third copy/paste because of some information that you
 cannot find from the function you implement here? `:-P`

 Could well be. My aim is to build a random interval in the Tamari
 lattices. For this I have to
 obtain a random minimal Schnyder wood. For the moment, this is only a
 project, so I cannot
 say right now how much code I will re-use.

--
Ticket URL: <http://trac.sagemath.org/ticket/19583#comment:15>
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.

Reply via email to