Area of a 2D convex hull Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern) The PPCG Site design is on its way - help us make it awesome! Sandbox for Proposed ChallengesWhat is the area of this polygon?Find the Convex Hull of a set of 2D pointsFind the area of the largest convex polygonPoint in convex hull (2D)The happy Ender problemDoes the triangle contain the origin?What is the area of this polygon?Sort the points by linear distance in a 3D spaceElliptic systemMaximum Area of a Polygon with Vertices of a PolygonCircle intersection area

Is it possible to ask for a hotel room without minibar/extra services?

How do I automatically answer y in bash script?

Is there folklore associating late breastfeeding with low intelligence and/or gullibility?

What computer would be fastest for Mathematica Home Edition?

How do I keep my slimes from escaping their pens?

What is the electric potential inside a point charge?

Do working physicists consider Newtonian mechanics to be "falsified"?

Passing functions in C++

Can a monk deflect thrown melee weapons?

Should you tell Jews they are breaking a commandment?

Writing Thesis: Copying from published papers

Why is there no army of Iron-Mans in the MCU?

How can I make names more distinctive without making them longer?

What are the performance impacts of 'functional' Rust?

Windows 10: How to Lock (not sleep) laptop on lid close?

How do you clear the ApexPages.getMessages() collection in a test?

Complexity of many constant time steps with occasional logarithmic steps

Need a suitable toxic chemical for a murder plot in my novel

What did Darwin mean by 'squib' here?

The following signatures were invalid: EXPKEYSIG 1397BC53640DB551

Slither Like a Snake

What kind of display is this?

Keep going mode for require-package

Blender game recording at the wrong time



Area of a 2D convex hull



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)
The PPCG Site design is on its way - help us make it awesome!
Sandbox for Proposed ChallengesWhat is the area of this polygon?Find the Convex Hull of a set of 2D pointsFind the area of the largest convex polygonPoint in convex hull (2D)The happy Ender problemDoes the triangle contain the origin?What is the area of this polygon?Sort the points by linear distance in a 3D spaceElliptic systemMaximum Area of a Polygon with Vertices of a PolygonCircle intersection area










1












$begingroup$


You are given an array/list/vector of pairs of integers representing cartesian coordinates (x, y) of points on a 2D Euclidean plane; all coordinates are between −104 and 104, duplicates are allowed. Find the area of the convex hull of those points, rounded to the nearest integer; an exact midpoint should be rounded to the closest even integer. You may use floating-point numbers in intermediate computations, but only if you can guarantee that the final result will be always correct. This is a code-golf, the shortest correct program (ignoring non-significant whitespace, newlines and comments) wins.



Some test cases:



Input: [[50, -13]]
Result: 0

Input: [[-25, -26], [34, -27]]
Result: 0

Input: [[-6, -14], [-48, -45], [21, 25]]
Result: 400

Input: [[4, 30], [5, 37], [-18, 49], [-9, -2]]
Result: 562

Input: [[0, 16], [24, 18], [-43, 36], [39, -29], [3, -38]]
Result: 2978

Input: [[19, -19], [15, 5], [-16, -41], [6, -25], [-42, 1], [12, 19]]
Result: 2118

Input: [[-23, 13], [-13, 13], [-6, -7], [22, 41], [-26, 50], [12, -12], [-23, -7]]
Result: 2307

Input: [[31, -19], [-41, -41], [25, 34], [29, -1], [42, -42], [-34, 32], [19, 33], [40, 39]]
Result: 6037

Input: [[47, 1], [-22, 24], [36, 38], [-17, 4], [41, -3], [-13, 15], [-36, -40], [-13, 35], [-25, 22]]
Result: 3908

Input: [[29, -19], [18, 9], [30, -46], [15, 20], [24, -4], [5, 19], [-44, 4], [-20, -8], [-16, 34], [17, -36]]
Result: 2905









share|improve this question











$endgroup$







  • 2




    $begingroup$
    Do you have any test cases?
    $endgroup$
    – Maltysen
    3 hours ago






  • 6




    $begingroup$
    Not counting whitespace in code golf is a bad idea, it leads to submissions with massive strings of whitespace plus generic code to convert the string to code and execute it.
    $endgroup$
    – xnor
    2 hours ago







  • 1




    $begingroup$
    So if someone can just make a whitespace solution...
    $endgroup$
    – attinat
    1 hour ago










  • $begingroup$
    Related
    $endgroup$
    – Giuseppe
    31 mins ago















1












$begingroup$


You are given an array/list/vector of pairs of integers representing cartesian coordinates (x, y) of points on a 2D Euclidean plane; all coordinates are between −104 and 104, duplicates are allowed. Find the area of the convex hull of those points, rounded to the nearest integer; an exact midpoint should be rounded to the closest even integer. You may use floating-point numbers in intermediate computations, but only if you can guarantee that the final result will be always correct. This is a code-golf, the shortest correct program (ignoring non-significant whitespace, newlines and comments) wins.



Some test cases:



Input: [[50, -13]]
Result: 0

Input: [[-25, -26], [34, -27]]
Result: 0

Input: [[-6, -14], [-48, -45], [21, 25]]
Result: 400

Input: [[4, 30], [5, 37], [-18, 49], [-9, -2]]
Result: 562

Input: [[0, 16], [24, 18], [-43, 36], [39, -29], [3, -38]]
Result: 2978

Input: [[19, -19], [15, 5], [-16, -41], [6, -25], [-42, 1], [12, 19]]
Result: 2118

Input: [[-23, 13], [-13, 13], [-6, -7], [22, 41], [-26, 50], [12, -12], [-23, -7]]
Result: 2307

Input: [[31, -19], [-41, -41], [25, 34], [29, -1], [42, -42], [-34, 32], [19, 33], [40, 39]]
Result: 6037

Input: [[47, 1], [-22, 24], [36, 38], [-17, 4], [41, -3], [-13, 15], [-36, -40], [-13, 35], [-25, 22]]
Result: 3908

Input: [[29, -19], [18, 9], [30, -46], [15, 20], [24, -4], [5, 19], [-44, 4], [-20, -8], [-16, 34], [17, -36]]
Result: 2905









share|improve this question











$endgroup$







  • 2




    $begingroup$
    Do you have any test cases?
    $endgroup$
    – Maltysen
    3 hours ago






  • 6




    $begingroup$
    Not counting whitespace in code golf is a bad idea, it leads to submissions with massive strings of whitespace plus generic code to convert the string to code and execute it.
    $endgroup$
    – xnor
    2 hours ago







  • 1




    $begingroup$
    So if someone can just make a whitespace solution...
    $endgroup$
    – attinat
    1 hour ago










  • $begingroup$
    Related
    $endgroup$
    – Giuseppe
    31 mins ago













1












1








1





$begingroup$


You are given an array/list/vector of pairs of integers representing cartesian coordinates (x, y) of points on a 2D Euclidean plane; all coordinates are between −104 and 104, duplicates are allowed. Find the area of the convex hull of those points, rounded to the nearest integer; an exact midpoint should be rounded to the closest even integer. You may use floating-point numbers in intermediate computations, but only if you can guarantee that the final result will be always correct. This is a code-golf, the shortest correct program (ignoring non-significant whitespace, newlines and comments) wins.



Some test cases:



Input: [[50, -13]]
Result: 0

Input: [[-25, -26], [34, -27]]
Result: 0

Input: [[-6, -14], [-48, -45], [21, 25]]
Result: 400

Input: [[4, 30], [5, 37], [-18, 49], [-9, -2]]
Result: 562

Input: [[0, 16], [24, 18], [-43, 36], [39, -29], [3, -38]]
Result: 2978

Input: [[19, -19], [15, 5], [-16, -41], [6, -25], [-42, 1], [12, 19]]
Result: 2118

Input: [[-23, 13], [-13, 13], [-6, -7], [22, 41], [-26, 50], [12, -12], [-23, -7]]
Result: 2307

Input: [[31, -19], [-41, -41], [25, 34], [29, -1], [42, -42], [-34, 32], [19, 33], [40, 39]]
Result: 6037

Input: [[47, 1], [-22, 24], [36, 38], [-17, 4], [41, -3], [-13, 15], [-36, -40], [-13, 35], [-25, 22]]
Result: 3908

Input: [[29, -19], [18, 9], [30, -46], [15, 20], [24, -4], [5, 19], [-44, 4], [-20, -8], [-16, 34], [17, -36]]
Result: 2905









share|improve this question











$endgroup$




You are given an array/list/vector of pairs of integers representing cartesian coordinates (x, y) of points on a 2D Euclidean plane; all coordinates are between −104 and 104, duplicates are allowed. Find the area of the convex hull of those points, rounded to the nearest integer; an exact midpoint should be rounded to the closest even integer. You may use floating-point numbers in intermediate computations, but only if you can guarantee that the final result will be always correct. This is a code-golf, the shortest correct program (ignoring non-significant whitespace, newlines and comments) wins.



Some test cases:



Input: [[50, -13]]
Result: 0

Input: [[-25, -26], [34, -27]]
Result: 0

Input: [[-6, -14], [-48, -45], [21, 25]]
Result: 400

Input: [[4, 30], [5, 37], [-18, 49], [-9, -2]]
Result: 562

Input: [[0, 16], [24, 18], [-43, 36], [39, -29], [3, -38]]
Result: 2978

Input: [[19, -19], [15, 5], [-16, -41], [6, -25], [-42, 1], [12, 19]]
Result: 2118

Input: [[-23, 13], [-13, 13], [-6, -7], [22, 41], [-26, 50], [12, -12], [-23, -7]]
Result: 2307

Input: [[31, -19], [-41, -41], [25, 34], [29, -1], [42, -42], [-34, 32], [19, 33], [40, 39]]
Result: 6037

Input: [[47, 1], [-22, 24], [36, 38], [-17, 4], [41, -3], [-13, 15], [-36, -40], [-13, 35], [-25, 22]]
Result: 3908

Input: [[29, -19], [18, 9], [30, -46], [15, 20], [24, -4], [5, 19], [-44, 4], [-20, -8], [-16, 34], [17, -36]]
Result: 2905






code-golf number geometry integer






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 2 hours ago







Vladimir Reshetnikov

















asked 3 hours ago









Vladimir ReshetnikovVladimir Reshetnikov

1,9781613




1,9781613







  • 2




    $begingroup$
    Do you have any test cases?
    $endgroup$
    – Maltysen
    3 hours ago






  • 6




    $begingroup$
    Not counting whitespace in code golf is a bad idea, it leads to submissions with massive strings of whitespace plus generic code to convert the string to code and execute it.
    $endgroup$
    – xnor
    2 hours ago







  • 1




    $begingroup$
    So if someone can just make a whitespace solution...
    $endgroup$
    – attinat
    1 hour ago










  • $begingroup$
    Related
    $endgroup$
    – Giuseppe
    31 mins ago












  • 2




    $begingroup$
    Do you have any test cases?
    $endgroup$
    – Maltysen
    3 hours ago






  • 6




    $begingroup$
    Not counting whitespace in code golf is a bad idea, it leads to submissions with massive strings of whitespace plus generic code to convert the string to code and execute it.
    $endgroup$
    – xnor
    2 hours ago







  • 1




    $begingroup$
    So if someone can just make a whitespace solution...
    $endgroup$
    – attinat
    1 hour ago










  • $begingroup$
    Related
    $endgroup$
    – Giuseppe
    31 mins ago







2




2




$begingroup$
Do you have any test cases?
$endgroup$
– Maltysen
3 hours ago




$begingroup$
Do you have any test cases?
$endgroup$
– Maltysen
3 hours ago




6




6




$begingroup$
Not counting whitespace in code golf is a bad idea, it leads to submissions with massive strings of whitespace plus generic code to convert the string to code and execute it.
$endgroup$
– xnor
2 hours ago





$begingroup$
Not counting whitespace in code golf is a bad idea, it leads to submissions with massive strings of whitespace plus generic code to convert the string to code and execute it.
$endgroup$
– xnor
2 hours ago





1




1




$begingroup$
So if someone can just make a whitespace solution...
$endgroup$
– attinat
1 hour ago




$begingroup$
So if someone can just make a whitespace solution...
$endgroup$
– attinat
1 hour ago












$begingroup$
Related
$endgroup$
– Giuseppe
31 mins ago




$begingroup$
Related
$endgroup$
– Giuseppe
31 mins ago










2 Answers
2






active

oldest

votes


















3












$begingroup$

SQL Server 2012+, 84 bytes



SELECT Round(Geometry::ConvexHullAggregate(Geometry::Point(x,y,0)).STArea(),0)FROM A


Makes use of the geometry functions and aggregates in SQL Server.
Coordindates are from table A with columns x and y.






share|improve this answer









$endgroup$




















    0












    $begingroup$


    Wolfram Language (Mathematica), 27 bytes



    Round@*Area@*ConvexHullMesh


    Try it online!






    share|improve this answer









    $endgroup$













      Your Answer






      StackExchange.ifUsing("editor", function ()
      StackExchange.using("externalEditor", function ()
      StackExchange.using("snippets", function ()
      StackExchange.snippets.init();
      );
      );
      , "code-snippets");

      StackExchange.ready(function()
      var channelOptions =
      tags: "".split(" "),
      id: "200"
      ;
      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: false,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: null,
      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
      ,
      onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      );



      );













      draft saved

      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f183191%2farea-of-a-2d-convex-hull%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









      3












      $begingroup$

      SQL Server 2012+, 84 bytes



      SELECT Round(Geometry::ConvexHullAggregate(Geometry::Point(x,y,0)).STArea(),0)FROM A


      Makes use of the geometry functions and aggregates in SQL Server.
      Coordindates are from table A with columns x and y.






      share|improve this answer









      $endgroup$

















        3












        $begingroup$

        SQL Server 2012+, 84 bytes



        SELECT Round(Geometry::ConvexHullAggregate(Geometry::Point(x,y,0)).STArea(),0)FROM A


        Makes use of the geometry functions and aggregates in SQL Server.
        Coordindates are from table A with columns x and y.






        share|improve this answer









        $endgroup$















          3












          3








          3





          $begingroup$

          SQL Server 2012+, 84 bytes



          SELECT Round(Geometry::ConvexHullAggregate(Geometry::Point(x,y,0)).STArea(),0)FROM A


          Makes use of the geometry functions and aggregates in SQL Server.
          Coordindates are from table A with columns x and y.






          share|improve this answer









          $endgroup$



          SQL Server 2012+, 84 bytes



          SELECT Round(Geometry::ConvexHullAggregate(Geometry::Point(x,y,0)).STArea(),0)FROM A


          Makes use of the geometry functions and aggregates in SQL Server.
          Coordindates are from table A with columns x and y.







          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 2 hours ago









          MickyTMickyT

          10.4k21637




          10.4k21637





















              0












              $begingroup$


              Wolfram Language (Mathematica), 27 bytes



              Round@*Area@*ConvexHullMesh


              Try it online!






              share|improve this answer









              $endgroup$

















                0












                $begingroup$


                Wolfram Language (Mathematica), 27 bytes



                Round@*Area@*ConvexHullMesh


                Try it online!






                share|improve this answer









                $endgroup$















                  0












                  0








                  0





                  $begingroup$


                  Wolfram Language (Mathematica), 27 bytes



                  Round@*Area@*ConvexHullMesh


                  Try it online!






                  share|improve this answer









                  $endgroup$




                  Wolfram Language (Mathematica), 27 bytes



                  Round@*Area@*ConvexHullMesh


                  Try it online!







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered 1 hour ago









                  attinatattinat

                  4897




                  4897



























                      draft saved

                      draft discarded
















































                      If this is an answer to a challenge…



                      • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


                      • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
                        Explanations of your answer make it more interesting to read and are very much encouraged.


                      • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.


                      More generally…



                      • …Please make sure to answer the question and provide sufficient detail.


                      • …Avoid asking for help, clarification or responding to other answers (use comments instead).




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f183191%2farea-of-a-2d-convex-hull%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

                      Disable / Remove link to Product Items in Cart Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How can I limit products that can be bought / added to cart?Remove item from cartHide “Add to Cart” button if specific products are already in cart“Prettifying” the custom options in cart pageCreate link in cart sidebar to view all added items After limit reachedLink products together in checkout/cartHow to Get product from cart and add it againHide action-edit on cart page if simple productRemoving Cart items - ObserverRemove wishlist items when added to cart

                      Helsingin valtaus Sisällysluettelo Taustaa | Yleistä sotatoimista | Osapuolet | Taistelut Helsingin ympäristössä | Punaisten antautumissuunnitelma | Taistelujen kulku Helsingissä | Valtauksen jälkeen | Tappiot | Muistaminen | Kirjallisuutta | Lähteet | Aiheesta muualla | NavigointivalikkoTeoksen verkkoversioTeoksen verkkoversioGoogle BooksSisällissota Helsingissä päättyi tasan 95 vuotta sittenSaksalaisten ylivoima jyräsi punaisen HelsinginSuomalaiset kuvaavat sotien jälkiä kaupungeissa – katso kuvat ja tarinat tutuilta kulmiltaHelsingin valtaus 90 vuotta sittenSaksalaiset valtasivat HelsinginHyökkäys HelsinkiinHelsingin valtaus 12.–13.4. 1918Saksalaiset käyttivät ihmiskilpiä Helsingin valtauksessa 1918Teoksen verkkoversioTeoksen verkkoversioSaksalaiset hyökkäävät Etelä-SuomeenTaistelut LeppävaarassaSotilaat ja taistelutLeppävaara 1918 huhtikuussa. KapinatarinaHelsingin taistelut 1918Saksalaisten voitonparaati HelsingissäHelsingin valtausta juhlittiinSaksalaisten Helsinki vuonna 1918Helsingin taistelussa kaatuneet valkokaartilaisetHelsinkiin haudatut taisteluissa kaatuneet punaiset12.4.1918 Helsingin valtauksessa saksalaiset apujoukot vapauttavat kaupunginVapaussodan muistomerkkejä Helsingissä ja pääkaupunkiseudullaCrescendo / Vuoden 1918 Kansalaissodan uhrien muistomerkkim

                      Adjektiivitarina Tarinan tekeminen | Esimerkki: ennen | Esimerkki: jälkeen | Navigointivalikko