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

Why use gamma over alpha radiation?

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

When communicating altitude with a '9' in it, should it be pronounced "nine hundred" or "niner hundred"?

What did Darwin mean by 'squib' here?

Unable to start mainnet node docker container

Working around an AWS network ACL rule limit

How do I keep my slimes from escaping their pens?

The following signatures were invalid: EXPKEYSIG 1397BC53640DB551

Why does tar appear to skip file contents when output file is /dev/null?

What items from the Roman-age tech-level could be used to deter all creatures from entering a small area?

Autumning in love

Stars Make Stars

What is the largest species of polychaete?

What's the point in a preamp?

Classification of bundles, Postnikov towers, obstruction theory, local coefficients

Passing functions in C++

Estimate capacitor parameters

Cold is to Refrigerator as warm is to?

Writing Thesis: Copying from published papers

Using "nakedly" instead of "with nothing on"

How to market an anarchic city as a tourism spot to people living in civilized areas?

Choo-choo! Word trains

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

New Order #5: where Fibonacci and Beatty meet at Wythoff



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










2












$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
    5 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
    5 hours ago







  • 1




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










  • $begingroup$
    Related
    $endgroup$
    – Giuseppe
    3 hours ago















2












$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
    5 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
    5 hours ago







  • 1




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










  • $begingroup$
    Related
    $endgroup$
    – Giuseppe
    3 hours ago













2












2








2





$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 5 hours ago







Vladimir Reshetnikov

















asked 6 hours ago









Vladimir ReshetnikovVladimir Reshetnikov

1,9831613




1,9831613







  • 2




    $begingroup$
    Do you have any test cases?
    $endgroup$
    – Maltysen
    5 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
    5 hours ago







  • 1




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










  • $begingroup$
    Related
    $endgroup$
    – Giuseppe
    3 hours ago












  • 2




    $begingroup$
    Do you have any test cases?
    $endgroup$
    – Maltysen
    5 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
    5 hours ago







  • 1




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










  • $begingroup$
    Related
    $endgroup$
    – Giuseppe
    3 hours ago







2




2




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




$begingroup$
Do you have any test cases?
$endgroup$
– Maltysen
5 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
5 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
5 hours ago





1




1




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




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












$begingroup$
Related
$endgroup$
– Giuseppe
3 hours ago




$begingroup$
Related
$endgroup$
– Giuseppe
3 hours 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$




















    2












    $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 5 hours ago









          MickyTMickyT

          10.4k21637




          10.4k21637





















              2












              $begingroup$


              Wolfram Language (Mathematica), 27 bytes



              Round@*Area@*ConvexHullMesh


              Try it online!






              share|improve this answer









              $endgroup$

















                2












                $begingroup$


                Wolfram Language (Mathematica), 27 bytes



                Round@*Area@*ConvexHullMesh


                Try it online!






                share|improve this answer









                $endgroup$















                  2












                  2








                  2





                  $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 3 hours ago









                  attinatattinat

                  5097




                  5097



























                      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

                      How to create a command for the “strange m” symbol in latex? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)How do you make your own symbol when Detexify fails?Writing bold small caps with mathpazo packageplus-minus symbol with parenthesis around the minus signGreek character in Beamer document titleHow to create dashed right arrow over symbol?Currency symbol: Turkish LiraDouble prec as a single symbol?Plus Sign Too Big; How to Call adfbullet?Is there a TeX macro for three-legged pi?How do I get my integral-like symbol to align like the integral?How to selectively substitute a letter with another symbol representing the same letterHow do I generate a less than symbol and vertical bar that are the same height?

                      Българска екзархия Съдържание История | Български екзарси | Вижте също | Външни препратки | Литература | Бележки | НавигацияУстав за управлението на българската екзархия. Цариград, 1870Слово на Ловешкия митрополит Иларион при откриването на Българския народен събор в Цариград на 23. II. 1870 г.Българската правда и гръцката кривда. От С. М. (= Софийски Мелетий). Цариград, 1872Предстоятели на Българската екзархияПодмененият ВеликденИнформационна агенция „Фокус“Димитър Ризов. Българите в техните исторически, етнографически и политически граници (Атлас съдържащ 40 карти). Berlin, Königliche Hoflithographie, Hof-Buch- und -Steindruckerei Wilhelm Greve, 1917Report of the International Commission to Inquire into the Causes and Conduct of the Balkan Wars

                      Category:Tremithousa Media in category "Tremithousa"Navigation menuUpload media34° 49′ 02.7″ N, 32° 26′ 37.32″ EOpenStreetMapGoogle EarthProximityramaReasonatorScholiaStatisticsWikiShootMe