On 2013-3-04 22:21, Asad Akhlaq wrote:
I am solving a problem where I want know that whether certain vertices on a hyperplane are connected to each other or not (i.e there exists an edge between two vertices). Say in a 2D plane, if I have 3 or more vertices (points), how can I decide that if all or some of these vertices are connected to each other? Similar is the problem for a hyperplane. Do we have any function/class is sage that can do it? I heard about convex hull algorithms but I don't know how to apply them to this problem. OR can we use graphs to solve this problem?
Vertices and edges of what? Seems to me you need either a graph or a convex hull for the question to have any meaning!
How does the problem arise? -- *\\* Anton Sherwood *\\* www.bendwavy.org -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
