Fdtxjr

Is there a name for this algorithm to calculate the concentration of a mixture of two solutions containing the same solute?

When were female captains banned from Starfleet?

If infinitesimal transformations commute why dont the generators of the Lorentz group commute?

Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?

What is Cash Advance APR?

How to indicate a cut out for a product window

Freedom of speech and where it applies

What does "Scientists rise up against statistical significance" mean? (Comment in Nature)

New brakes for 90s road bike

Why did the Mercure fail?

The screen of my macbook suddenly broken down how can I do to recover

Is it better practice to read straight from sheet music rather than memorize it?

How should I respond when I lied about my education and the company finds out through background check?

Biological Blimps: Propulsion

Strong empirical falsification of quantum mechanics based on vacuum energy density

Why did the EU agree to delay the Brexit deadline?

"Spoil" vs "Ruin"

How can "mimic phobia" be cured or prevented?

2.8 Why are collections grayed out? How can I open them?

Loading commands from file

How to implement a feedback to keep the DC gain at zero for this conceptual passive filter?

What does routing an IP address mean?

What should you do if you miss a job interview (deliberately)?

Why electric field inside a cavity of a non-conducting sphere not zero?

How to check does polygon with given sides' length exist?

how to find if it is possible to form a convex polygon with given n sides length?How to find the area of a quadrilateral given only the length of it's sides?For set of segments, check if they can create n-side polygonResolving an area of a polygon with sides knownHow to calculate perimeter of Polygon with missing the length of one side?Area Of Polygon Whose Edges Are In Given Distance From A Given Polygon EdgesCheck if convex polygon is completely contained completely within another convex polygon.Determining the position of a polygon inside a circle from only the angle of opposing sides/edges.Given angles/sides, is there a necessary and sufficient condition on whether polygon exists?Area of minimum regular polygon given three verticesHow do I find the angles of a polygon if I only have the lengths of the sides?Is area of a polygon independent of the angle formed by its sides?Can a non-equilateral triangle with integer sides and integer angles (in degrees) exist?

3

$begingroup$

I have polygon with $n$ angles. Then I have got $n$ values, which mean this polygon's sides' length. I have to check does this polygon exist (means - could be drawn with given sides' length). Is there any overall formula to check that? (like e.g. $a+bge c$, $a+cge b$, $c+bge a$ for triangle)

geometry polygons

share|cite|improve this question

edited Jun 13 '14 at 21:48

Matt E

105k8220390

asked Jun 13 '14 at 10:19

TN888TN888

220312

$endgroup$

add a comment | 

3

$begingroup$

I have polygon with $n$ angles. Then I have got $n$ values, which mean this polygon's sides' length. I have to check does this polygon exist (means - could be drawn with given sides' length). Is there any overall formula to check that? (like e.g. $a+bge c$, $a+cge b$, $c+bge a$ for triangle)

geometry polygons

share|cite|improve this question

edited Jun 13 '14 at 21:48

Matt E

105k8220390

asked Jun 13 '14 at 10:19

TN888TN888

220312

$endgroup$

add a comment | 

$begingroup$

I have polygon with $n$ angles. Then I have got $n$ values, which mean this polygon's sides' length. I have to check does this polygon exist (means - could be drawn with given sides' length). Is there any overall formula to check that? (like e.g. $a+bge c$, $a+cge b$, $c+bge a$ for triangle)

geometry polygons

share|cite|improve this question

edited Jun 13 '14 at 21:48

Matt E

105k8220390

asked Jun 13 '14 at 10:19

TN888TN888

220312

$endgroup$

share|cite|improve this question

edited Jun 13 '14 at 21:48

Matt E

105k8220390

asked Jun 13 '14 at 10:19

TN888TN888

220312

share|cite|improve this question

edited Jun 13 '14 at 21:48

Matt E

105k8220390

asked Jun 13 '14 at 10:19

TN888TN888

220312

edited Jun 13 '14 at 21:48

Matt E

105k8220390

edited Jun 13 '14 at 21:48

Matt E

105k8220390

asked Jun 13 '14 at 10:19

TN888TN888

220312

asked Jun 13 '14 at 10:19

TN888TN888

220312

2 Answers
2

active

oldest

votes

5

$begingroup$

The only rigid polygons are triangles. If $n>3$, then there are many polygons with the same sequence of sides. This can be proved by cutting the polygon along a diagonal and using induction. The only restriction is the triangle inequality: each side is less than the sum of the other sides. Indeed, given a sequence of sides satisfying the triangle inequality you can find a triangle whose sides are two consecutives sides and the third is the remaining sides straightened flat. If you insist on angles less than $pi$, just perturb this a bit.

share|cite|improve this answer

edited Jun 13 '14 at 11:57

answered Jun 13 '14 at 11:52

lhflhf

166k11172402

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  For the existence of a diagonal, see chapter 1 of Discrete and Computational Geometry by Devadoss and O'Rourke.
  $endgroup$
  – lhf
  Jun 13 '14 at 11:56
  
  

  
  
  
  

add a comment | 

1

$begingroup$

No, there's no overall formula. There are some weak conditions (the sum of any $n-1$ sides' lengths must be greater than the length of the remaining side, for instance), but this is merely necessary for the existence of any polygon with those side-lengths, not one that has your desired angles. Is it sufficient? I'm not certain offhand.

Re-reading, perhaps when you said that you "have "n" angles" you meant "I'm looking for an $n$-angle polygon".

In that case, the inequalities I cited above are necessary, but are they sufficient? I suspect that they are, although they'd only guarantee a polygon with those side-lengths...not a non-self-intersecting polygon. For that latter condition, you'd have to do some additional work.

share|cite|improve this answer

edited Jun 13 '14 at 11:22

answered Jun 13 '14 at 11:10

John HughesJohn Hughes

64.8k24292

$endgroup$

add a comment | 

Your Answer

StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f832716%2fhow-to-check-does-polygon-with-given-sides-length-exist%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

5

$begingroup$

The only rigid polygons are triangles. If $n>3$, then there are many polygons with the same sequence of sides. This can be proved by cutting the polygon along a diagonal and using induction. The only restriction is the triangle inequality: each side is less than the sum of the other sides. Indeed, given a sequence of sides satisfying the triangle inequality you can find a triangle whose sides are two consecutives sides and the third is the remaining sides straightened flat. If you insist on angles less than $pi$, just perturb this a bit.

share|cite|improve this answer

edited Jun 13 '14 at 11:57

answered Jun 13 '14 at 11:52

lhflhf

166k11172402

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  For the existence of a diagonal, see chapter 1 of Discrete and Computational Geometry by Devadoss and O'Rourke.
  $endgroup$
  – lhf
  Jun 13 '14 at 11:56
  
  

  
  
  
  

add a comment | 

5

$begingroup$

The only rigid polygons are triangles. If $n>3$, then there are many polygons with the same sequence of sides. This can be proved by cutting the polygon along a diagonal and using induction. The only restriction is the triangle inequality: each side is less than the sum of the other sides. Indeed, given a sequence of sides satisfying the triangle inequality you can find a triangle whose sides are two consecutives sides and the third is the remaining sides straightened flat. If you insist on angles less than $pi$, just perturb this a bit.

share|cite|improve this answer

edited Jun 13 '14 at 11:57

answered Jun 13 '14 at 11:52

lhflhf

166k11172402

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  For the existence of a diagonal, see chapter 1 of Discrete and Computational Geometry by Devadoss and O'Rourke.
  $endgroup$
  – lhf
  Jun 13 '14 at 11:56
  
  

  
  
  
  

add a comment | 

$begingroup$

The only rigid polygons are triangles. If $n>3$, then there are many polygons with the same sequence of sides. This can be proved by cutting the polygon along a diagonal and using induction. The only restriction is the triangle inequality: each side is less than the sum of the other sides. Indeed, given a sequence of sides satisfying the triangle inequality you can find a triangle whose sides are two consecutives sides and the third is the remaining sides straightened flat. If you insist on angles less than $pi$, just perturb this a bit.

share|cite|improve this answer

edited Jun 13 '14 at 11:57

answered Jun 13 '14 at 11:52

lhflhf

166k11172402

$endgroup$

share|cite|improve this answer

edited Jun 13 '14 at 11:57

answered Jun 13 '14 at 11:52

lhflhf

166k11172402

answered Jun 13 '14 at 11:52

lhflhf

166k11172402

answered Jun 13 '14 at 11:52

lhflhf

166k11172402

1

$begingroup$

No, there's no overall formula. There are some weak conditions (the sum of any $n-1$ sides' lengths must be greater than the length of the remaining side, for instance), but this is merely necessary for the existence of any polygon with those side-lengths, not one that has your desired angles. Is it sufficient? I'm not certain offhand.

Re-reading, perhaps when you said that you "have "n" angles" you meant "I'm looking for an $n$-angle polygon".

In that case, the inequalities I cited above are necessary, but are they sufficient? I suspect that they are, although they'd only guarantee a polygon with those side-lengths...not a non-self-intersecting polygon. For that latter condition, you'd have to do some additional work.

share|cite|improve this answer

edited Jun 13 '14 at 11:22

answered Jun 13 '14 at 11:10

John HughesJohn Hughes

64.8k24292

$endgroup$

add a comment | 

1

$begingroup$

No, there's no overall formula. There are some weak conditions (the sum of any $n-1$ sides' lengths must be greater than the length of the remaining side, for instance), but this is merely necessary for the existence of any polygon with those side-lengths, not one that has your desired angles. Is it sufficient? I'm not certain offhand.

Re-reading, perhaps when you said that you "have "n" angles" you meant "I'm looking for an $n$-angle polygon".

In that case, the inequalities I cited above are necessary, but are they sufficient? I suspect that they are, although they'd only guarantee a polygon with those side-lengths...not a non-self-intersecting polygon. For that latter condition, you'd have to do some additional work.

share|cite|improve this answer

edited Jun 13 '14 at 11:22

answered Jun 13 '14 at 11:10

John HughesJohn Hughes

64.8k24292

$endgroup$

add a comment | 

$begingroup$

No, there's no overall formula. There are some weak conditions (the sum of any $n-1$ sides' lengths must be greater than the length of the remaining side, for instance), but this is merely necessary for the existence of any polygon with those side-lengths, not one that has your desired angles. Is it sufficient? I'm not certain offhand.

Re-reading, perhaps when you said that you "have "n" angles" you meant "I'm looking for an $n$-angle polygon".

In that case, the inequalities I cited above are necessary, but are they sufficient? I suspect that they are, although they'd only guarantee a polygon with those side-lengths...not a non-self-intersecting polygon. For that latter condition, you'd have to do some additional work.

share|cite|improve this answer

edited Jun 13 '14 at 11:22

answered Jun 13 '14 at 11:10

John HughesJohn Hughes

64.8k24292

$endgroup$

share|cite|improve this answer

edited Jun 13 '14 at 11:22

answered Jun 13 '14 at 11:10

John HughesJohn Hughes

64.8k24292

answered Jun 13 '14 at 11:10

John HughesJohn Hughes

64.8k24292

answered Jun 13 '14 at 11:10

John HughesJohn Hughes

64.8k24292