# Determining A valid Convex Hexagon given The length of Six sides

Suppose We are given the length of all six sides of a Convex Hexagon. How can we tell whether it's valid or Not ? that means can we tell whether it's area is positive or not ?

-
I'm not sure why this was edited just now - it is clear from JoR's answer that if the longest edge is equal to the sum of the others, the area is zero. On the other hand, if the area is zero, it does not imply that this condition holds, for example all edges could be the same length. –  Carl Apr 30 '14 at 6:38
I interpreted the question differently in my answer, but I see now that other interpretations are possible. –  Joseph O'Rourke Apr 30 '14 at 15:39

A chain of edges can close iff the longest edge is not longer than the sum of the lengths of all the other edges. This is Theorem 8.6.3 (p.326) in Computational Geometry in C and Theorem 5.1.2 (p.61) in Geometric Folding Algorithms. You can easily see the necessity of this condition: If one edge $e$ is too long, the others all together cannot reach from end-to-end of $e$.
This result has nothing to do with $6$; it holds for $n \ge 3$ edges.