MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

how i determine a face of a planar graph is convex polygon or not..............

share|cite|improve this question

closed as not a real question by Robin Chapman, Loop Space, François G. Dorais, S. Carnahan, Pete L. Clark Jun 15 '10 at 15:12

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

I can't make sense of this as it stands. A planar graph is one which can be embedded into the plane. Your question only makes sense for an actual emebedding in the plane, and I cannot see any sensible answer save that a face is a convex polygon if it's a convex polygon. Perhaps a more precise question is lurking? – Robin Chapman Jun 15 '10 at 6:37
With a protractor, I suppose. You may want to expand on your question to make it easier to know what exactly you are asking. – Gerry Myerson Jun 15 '10 at 6:38
I'm going to take a wild guess and say the question is asking whether one can tell if a face of a planar graph is a convex polygon before the graph is drawn with edges as straight line segments. That is, in the beginning, you are given a random drawing where the edges could be curved. Still, I believe the question will be closed unless the OP makes it clear what is being asked. – Gjergji Zaimi Jun 15 '10 at 7:32
Perhaps you are asking for the result of Steinitz's Theorem: Which planar graphs are $1-$skeletons of convex polytopes. Answer: The underlying abstract graph has to be $3-$edge connected. Such graphs have essentially (up to isotopies and an orientation reversing homeomorphism) only one planar embedding coming from a realization as the $1-$skeleton of a convex polytope. – Roland Bacher Jun 15 '10 at 8:37
The question has been closed: we simply don't know what you're asking. If you edit it to provide enough information, precision and context so that we can understand it (and, for bonus points, use proper punctuation and grammar, to the best of your ability), it can be reopened. – Pete L. Clark Jun 15 '10 at 15:14

this is not a well defined question. Perhaps you mean that you want to know if a face of a planar embedding of a planar graph is convex ? Note that it's always possible to draw a planar graph so all faces (with the exception of the outer face) are convex

share|cite|improve this answer
(I think that this should have been left as a comment, not an answer) – Loop Space Jun 15 '10 at 7:54

Not the answer you're looking for? Browse other questions tagged or ask your own question.