Number of diagonals of a concave polygons formula?












0














Does this formula also apply to concave polygons?



enter image description here










share|cite|improve this question






















  • It depends on what you mean by "distinct diagonal." The expression $n(n-3)/2$ counts the number of ways to select two non-adjacent vertices of any polygon. But in a concave polygon, the lines connecting such pairs may overlap.
    – angryavian
    Dec 4 '18 at 20:46


















0














Does this formula also apply to concave polygons?



enter image description here










share|cite|improve this question






















  • It depends on what you mean by "distinct diagonal." The expression $n(n-3)/2$ counts the number of ways to select two non-adjacent vertices of any polygon. But in a concave polygon, the lines connecting such pairs may overlap.
    – angryavian
    Dec 4 '18 at 20:46
















0












0








0







Does this formula also apply to concave polygons?



enter image description here










share|cite|improve this question













Does this formula also apply to concave polygons?



enter image description here







geometry






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 4 '18 at 20:40









caasdadscaasdads

957




957












  • It depends on what you mean by "distinct diagonal." The expression $n(n-3)/2$ counts the number of ways to select two non-adjacent vertices of any polygon. But in a concave polygon, the lines connecting such pairs may overlap.
    – angryavian
    Dec 4 '18 at 20:46




















  • It depends on what you mean by "distinct diagonal." The expression $n(n-3)/2$ counts the number of ways to select two non-adjacent vertices of any polygon. But in a concave polygon, the lines connecting such pairs may overlap.
    – angryavian
    Dec 4 '18 at 20:46


















It depends on what you mean by "distinct diagonal." The expression $n(n-3)/2$ counts the number of ways to select two non-adjacent vertices of any polygon. But in a concave polygon, the lines connecting such pairs may overlap.
– angryavian
Dec 4 '18 at 20:46






It depends on what you mean by "distinct diagonal." The expression $n(n-3)/2$ counts the number of ways to select two non-adjacent vertices of any polygon. But in a concave polygon, the lines connecting such pairs may overlap.
– angryavian
Dec 4 '18 at 20:46












2 Answers
2






active

oldest

votes


















2














Yes, no, and maybe, depending on what you mean by diagonal and distinct. For a convex polygon of $n$ vertices, you can draw a diagonal by choosing one vertex ($n$ ways), choosing a second vertex that is not the first nor connected to the first ($n-3$ ways), and dividing by $2$ because you can start at either end of the diagonal. This process works fine for a concave polygon, too, so yes. Some of the diagonals are outside the polygon, so if you require a diagonal to lie within the polygon, no. You can create a concave polygon so that more than two noncontiguous vertices are on a line. If you do, some of the diagonals will overlap, which may violate your definition of distinct, so maybe.






share|cite|improve this answer































    1














    If you count all the diagonals, including the ones that lie outside the polygon, yes.



    EXCEPT that, if you have enough points and enough ingenuity, you can arrange the points of the polygon so that some diagonal somewhere will lie directly on top of some other diagonal. In that case, do you have two diagonals, with one "hidden", or do you have one diagonal that does "double duty" in connecting, not two, but three or more points? That's a question of definition and I'm not sure what the standard answer is.






    share|cite|improve this answer





















      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


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3026130%2fnumber-of-diagonals-of-a-concave-polygons-formula%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2














      Yes, no, and maybe, depending on what you mean by diagonal and distinct. For a convex polygon of $n$ vertices, you can draw a diagonal by choosing one vertex ($n$ ways), choosing a second vertex that is not the first nor connected to the first ($n-3$ ways), and dividing by $2$ because you can start at either end of the diagonal. This process works fine for a concave polygon, too, so yes. Some of the diagonals are outside the polygon, so if you require a diagonal to lie within the polygon, no. You can create a concave polygon so that more than two noncontiguous vertices are on a line. If you do, some of the diagonals will overlap, which may violate your definition of distinct, so maybe.






      share|cite|improve this answer




























        2














        Yes, no, and maybe, depending on what you mean by diagonal and distinct. For a convex polygon of $n$ vertices, you can draw a diagonal by choosing one vertex ($n$ ways), choosing a second vertex that is not the first nor connected to the first ($n-3$ ways), and dividing by $2$ because you can start at either end of the diagonal. This process works fine for a concave polygon, too, so yes. Some of the diagonals are outside the polygon, so if you require a diagonal to lie within the polygon, no. You can create a concave polygon so that more than two noncontiguous vertices are on a line. If you do, some of the diagonals will overlap, which may violate your definition of distinct, so maybe.






        share|cite|improve this answer


























          2












          2








          2






          Yes, no, and maybe, depending on what you mean by diagonal and distinct. For a convex polygon of $n$ vertices, you can draw a diagonal by choosing one vertex ($n$ ways), choosing a second vertex that is not the first nor connected to the first ($n-3$ ways), and dividing by $2$ because you can start at either end of the diagonal. This process works fine for a concave polygon, too, so yes. Some of the diagonals are outside the polygon, so if you require a diagonal to lie within the polygon, no. You can create a concave polygon so that more than two noncontiguous vertices are on a line. If you do, some of the diagonals will overlap, which may violate your definition of distinct, so maybe.






          share|cite|improve this answer














          Yes, no, and maybe, depending on what you mean by diagonal and distinct. For a convex polygon of $n$ vertices, you can draw a diagonal by choosing one vertex ($n$ ways), choosing a second vertex that is not the first nor connected to the first ($n-3$ ways), and dividing by $2$ because you can start at either end of the diagonal. This process works fine for a concave polygon, too, so yes. Some of the diagonals are outside the polygon, so if you require a diagonal to lie within the polygon, no. You can create a concave polygon so that more than two noncontiguous vertices are on a line. If you do, some of the diagonals will overlap, which may violate your definition of distinct, so maybe.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 4 '18 at 20:53

























          answered Dec 4 '18 at 20:46









          Ross MillikanRoss Millikan

          292k23197371




          292k23197371























              1














              If you count all the diagonals, including the ones that lie outside the polygon, yes.



              EXCEPT that, if you have enough points and enough ingenuity, you can arrange the points of the polygon so that some diagonal somewhere will lie directly on top of some other diagonal. In that case, do you have two diagonals, with one "hidden", or do you have one diagonal that does "double duty" in connecting, not two, but three or more points? That's a question of definition and I'm not sure what the standard answer is.






              share|cite|improve this answer


























                1














                If you count all the diagonals, including the ones that lie outside the polygon, yes.



                EXCEPT that, if you have enough points and enough ingenuity, you can arrange the points of the polygon so that some diagonal somewhere will lie directly on top of some other diagonal. In that case, do you have two diagonals, with one "hidden", or do you have one diagonal that does "double duty" in connecting, not two, but three or more points? That's a question of definition and I'm not sure what the standard answer is.






                share|cite|improve this answer
























                  1












                  1








                  1






                  If you count all the diagonals, including the ones that lie outside the polygon, yes.



                  EXCEPT that, if you have enough points and enough ingenuity, you can arrange the points of the polygon so that some diagonal somewhere will lie directly on top of some other diagonal. In that case, do you have two diagonals, with one "hidden", or do you have one diagonal that does "double duty" in connecting, not two, but three or more points? That's a question of definition and I'm not sure what the standard answer is.






                  share|cite|improve this answer












                  If you count all the diagonals, including the ones that lie outside the polygon, yes.



                  EXCEPT that, if you have enough points and enough ingenuity, you can arrange the points of the polygon so that some diagonal somewhere will lie directly on top of some other diagonal. In that case, do you have two diagonals, with one "hidden", or do you have one diagonal that does "double duty" in connecting, not two, but three or more points? That's a question of definition and I'm not sure what the standard answer is.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 4 '18 at 20:46









                  bob.sacamentobob.sacamento

                  2,4261819




                  2,4261819






























                      draft saved

                      draft discarded




















































                      Thanks for contributing an answer to Mathematics Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid



                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.


                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.





                      Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                      Please pay close attention to the following guidance:


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid



                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3026130%2fnumber-of-diagonals-of-a-concave-polygons-formula%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      Popular posts from this blog

                      Berounka

                      Different font size/position of beamer's navigation symbols template's content depending on regular/plain...

                      Sphinx de Gizeh