#15022: adjacency graph for a triangulation
-------------------------+-------------------------------------------------
Reporter: ursula | Owner:
Type: | Status: new
enhancement | Milestone: sage-5.12
Priority: minor | Keywords:
Component: | Authors: Stephen Farley, Ursula
combinatorics | Whitcher
Merged in: | Report Upstream: N/A
Reviewers: | Branch:
Work issues: | Stopgaps:
Dependencies: |
-------------------------+-------------------------------------------------
This function creates the adjacency graph associated to a triangulation of
a point configuration. Such a graph has one node for each top-dimensional
simplex in the triangulation. Two nodes are joined by an edge if the
corresponding simplices intersect in a simplex of codimension 1.
--
Ticket URL: <http://trac.sagemath.org/ticket/15022>
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/groups/opt_out.
