#10276: Create a random triangulation (max planar graph)
----------------------------------+-----------------------------------------
Reporter: edward.scheinerman | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_info
Priority: major | Milestone:
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author: Ed Scheinerman
Merged: | Dependencies:
----------------------------------+-----------------------------------------
Comment(by rbeezer):
Dear Ed,
That all sounds good. I think a graph can carry an embedding, as a
logical construction - the neighbors of a vertex as an ordered list, we
ought to capture that at a minimum. (Need to double-check on that.) Then
if a general layout algorithm can utilize that information, the visual
appeal might improve in the future. But I would like to see if the actual
coordinates from the stereographic projection are useful as well. And I
may appeal to the sage-devel list for ideas.
So, please send me any ideas for code off-list at {{{[email protected]}}} and
I'll see what I can do. Next two weeks are very hectic - finishing a
course in Cape Town and starting new ones at home, so there may be a delay
until life settles down.
Thanks,
Rob
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10276#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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
