Convex hull spanning n-percent of points











up vote
0
down vote

favorite












I would like to calculate the convex hull of some points, but neglect some "outlier" points. I.e. in the end i would like to have the convex hull spanning, let's say, 90% of the points instead of all.
How would I best do that, is there a known algorithm for that?
And if yes, can I even hope for a Python implementation?
Thanks a lot.










share|cite|improve this question







New contributor




Gemini is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
























    up vote
    0
    down vote

    favorite












    I would like to calculate the convex hull of some points, but neglect some "outlier" points. I.e. in the end i would like to have the convex hull spanning, let's say, 90% of the points instead of all.
    How would I best do that, is there a known algorithm for that?
    And if yes, can I even hope for a Python implementation?
    Thanks a lot.










    share|cite|improve this question







    New contributor




    Gemini is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.






















      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      I would like to calculate the convex hull of some points, but neglect some "outlier" points. I.e. in the end i would like to have the convex hull spanning, let's say, 90% of the points instead of all.
      How would I best do that, is there a known algorithm for that?
      And if yes, can I even hope for a Python implementation?
      Thanks a lot.










      share|cite|improve this question







      New contributor




      Gemini is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      I would like to calculate the convex hull of some points, but neglect some "outlier" points. I.e. in the end i would like to have the convex hull spanning, let's say, 90% of the points instead of all.
      How would I best do that, is there a known algorithm for that?
      And if yes, can I even hope for a Python implementation?
      Thanks a lot.







      convex-hulls






      share|cite|improve this question







      New contributor




      Gemini is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|cite|improve this question







      New contributor




      Gemini is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|cite|improve this question




      share|cite|improve this question






      New contributor




      Gemini is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 12 hours ago









      Gemini

      1




      1




      New contributor




      Gemini is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Gemini is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Gemini is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.



























          active

          oldest

          votes











          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',
          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
          });


          }
          });






          Gemini is a new contributor. Be nice, and check out our Code of Conduct.










           

          draft saved


          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2995436%2fconvex-hull-spanning-n-percent-of-points%23new-answer', 'question_page');
          }
          );

          Post as a guest





































          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          Gemini is a new contributor. Be nice, and check out our Code of Conduct.










           

          draft saved


          draft discarded


















          Gemini is a new contributor. Be nice, and check out our Code of Conduct.













          Gemini is a new contributor. Be nice, and check out our Code of Conduct.












          Gemini is a new contributor. Be nice, and check out our Code of Conduct.















           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2995436%2fconvex-hull-spanning-n-percent-of-points%23new-answer', 'question_page');
          }
          );

          Post as a guest




















































































          Popular posts from this blog

          Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

          ComboBox Display Member on multiple fields

          Is it possible to collect Nectar points via Trainline?