Existing of non-intersecting raysConstructing a circle through a point in the interior of an angleHow many rays can made from $4$ collinear points?Angle between different rays (3d line segments) and computing their angular relationshipsIntersecting three rays and a sphere of known radiusDesigning a distance function between raysLines between point and sphere surface intersecting a planeIntersecting planes stereometry problemIs a single line, line segment, or ray a valid angle?Coxeter, Introduction to Geometry, ordered geometry, parallelism of rays and linesNon-congruent angle of an isosceles triangle

Why were helmets and other body armour not commonplace in the 1800s?

How did NASA Langley end up with the first 737?

Why isn't 'chemically-strengthened glass' made with potassium carbonate to begin with?

How to politely tell someone they did not hit "reply to all" in an email?

My employer faked my resume to acquire projects

Why most published works in medical imaging try reducing false positives?

Are black holes spherical during merger?

Why do Russians almost not use verbs of possession akin to "have"?

Does pair production happen even when the photon is around a neutron?

Apt - strange requests to d16r8ew072anqo.cloudfront.net:80

Is it legal to have an abortion in another state or abroad?

Can a British citizen living in France vote in both France and Britain in the European Elections?

Efficient Algorithm for the boundary of a set of tiles

What is a Centaur Thief's climbing speed?

Could a 19.25mm revolver actually exist?

What does $!# mean in Shell scripting?

Can I tell a prospective employee that everyone in the team is leaving?

Why are GND pads often only connected by four traces?

Should one buy new hardware after a system compromise?

Did this character show any indication of wanting to rule before S8E6?

Why didn't Thanos use the Time Stone to stop the Avengers' plan?

Is it possible to remotely hack the GPS system and disable GPS service worldwide?

Count rotary dial pulses in a phone number (including letters)

Did 20% of US soldiers in Vietnam use heroin, 95% of whom quit afterwards?



Existing of non-intersecting rays


Constructing a circle through a point in the interior of an angleHow many rays can made from $4$ collinear points?Angle between different rays (3d line segments) and computing their angular relationshipsIntersecting three rays and a sphere of known radiusDesigning a distance function between raysLines between point and sphere surface intersecting a planeIntersecting planes stereometry problemIs a single line, line segment, or ray a valid angle?Coxeter, Introduction to Geometry, ordered geometry, parallelism of rays and linesNon-congruent angle of an isosceles triangle













2












$begingroup$


Given $n$ points on a plane, it seems intuitive that it’s possible to draw a ray (half-line) from each point s. t. the $n$ rays do not intersect.



But how to prove this?










share|cite|improve this question









$endgroup$
















    2












    $begingroup$


    Given $n$ points on a plane, it seems intuitive that it’s possible to draw a ray (half-line) from each point s. t. the $n$ rays do not intersect.



    But how to prove this?










    share|cite|improve this question









    $endgroup$














      2












      2








      2


      1



      $begingroup$


      Given $n$ points on a plane, it seems intuitive that it’s possible to draw a ray (half-line) from each point s. t. the $n$ rays do not intersect.



      But how to prove this?










      share|cite|improve this question









      $endgroup$




      Given $n$ points on a plane, it seems intuitive that it’s possible to draw a ray (half-line) from each point s. t. the $n$ rays do not intersect.



      But how to prove this?







      geometry






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Mar 24 at 2:19









      athosathos

      1,03911440




      1,03911440




















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.



          One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            +1 for being slightly faster than me :)
            $endgroup$
            – Severin Schraven
            Mar 24 at 2:31










          • $begingroup$
            Thx ! This is a “oh of course “ moment of me
            $endgroup$
            – athos
            Mar 24 at 2:32










          • $begingroup$
            It is almost trivial but you need to prove the existence of a point $P$ not collinear to the rest, for example consider the case of points all lying on the same line where this property fails. Luckily the orientation method works in that case too and the existence of such an orientation is guaranteed since picking an arbitary axis the angle of the line between any two points form a finite set.
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:46










          • $begingroup$
            @ΜάρκοςΚαραμέρης $P$ is not one of the given points. Since a finite set of lines does not exhaust the plane, there are plenty of possible choices.
            $endgroup$
            – FredH
            Mar 24 at 2:48










          • $begingroup$
            @FredH Ah ok makes perfect sense now!
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:52












          Your Answer








          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%2f3160029%2fexisting-of-non-intersecting-rays%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          2












          $begingroup$

          Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.



          One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            +1 for being slightly faster than me :)
            $endgroup$
            – Severin Schraven
            Mar 24 at 2:31










          • $begingroup$
            Thx ! This is a “oh of course “ moment of me
            $endgroup$
            – athos
            Mar 24 at 2:32










          • $begingroup$
            It is almost trivial but you need to prove the existence of a point $P$ not collinear to the rest, for example consider the case of points all lying on the same line where this property fails. Luckily the orientation method works in that case too and the existence of such an orientation is guaranteed since picking an arbitary axis the angle of the line between any two points form a finite set.
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:46










          • $begingroup$
            @ΜάρκοςΚαραμέρης $P$ is not one of the given points. Since a finite set of lines does not exhaust the plane, there are plenty of possible choices.
            $endgroup$
            – FredH
            Mar 24 at 2:48










          • $begingroup$
            @FredH Ah ok makes perfect sense now!
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:52
















          2












          $begingroup$

          Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.



          One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            +1 for being slightly faster than me :)
            $endgroup$
            – Severin Schraven
            Mar 24 at 2:31










          • $begingroup$
            Thx ! This is a “oh of course “ moment of me
            $endgroup$
            – athos
            Mar 24 at 2:32










          • $begingroup$
            It is almost trivial but you need to prove the existence of a point $P$ not collinear to the rest, for example consider the case of points all lying on the same line where this property fails. Luckily the orientation method works in that case too and the existence of such an orientation is guaranteed since picking an arbitary axis the angle of the line between any two points form a finite set.
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:46










          • $begingroup$
            @ΜάρκοςΚαραμέρης $P$ is not one of the given points. Since a finite set of lines does not exhaust the plane, there are plenty of possible choices.
            $endgroup$
            – FredH
            Mar 24 at 2:48










          • $begingroup$
            @FredH Ah ok makes perfect sense now!
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:52














          2












          2








          2





          $begingroup$

          Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.



          One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.






          share|cite|improve this answer











          $endgroup$



          Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.



          One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Mar 24 at 2:37

























          answered Mar 24 at 2:30









          FredHFredH

          3,7321024




          3,7321024











          • $begingroup$
            +1 for being slightly faster than me :)
            $endgroup$
            – Severin Schraven
            Mar 24 at 2:31










          • $begingroup$
            Thx ! This is a “oh of course “ moment of me
            $endgroup$
            – athos
            Mar 24 at 2:32










          • $begingroup$
            It is almost trivial but you need to prove the existence of a point $P$ not collinear to the rest, for example consider the case of points all lying on the same line where this property fails. Luckily the orientation method works in that case too and the existence of such an orientation is guaranteed since picking an arbitary axis the angle of the line between any two points form a finite set.
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:46










          • $begingroup$
            @ΜάρκοςΚαραμέρης $P$ is not one of the given points. Since a finite set of lines does not exhaust the plane, there are plenty of possible choices.
            $endgroup$
            – FredH
            Mar 24 at 2:48










          • $begingroup$
            @FredH Ah ok makes perfect sense now!
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:52

















          • $begingroup$
            +1 for being slightly faster than me :)
            $endgroup$
            – Severin Schraven
            Mar 24 at 2:31










          • $begingroup$
            Thx ! This is a “oh of course “ moment of me
            $endgroup$
            – athos
            Mar 24 at 2:32










          • $begingroup$
            It is almost trivial but you need to prove the existence of a point $P$ not collinear to the rest, for example consider the case of points all lying on the same line where this property fails. Luckily the orientation method works in that case too and the existence of such an orientation is guaranteed since picking an arbitary axis the angle of the line between any two points form a finite set.
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:46










          • $begingroup$
            @ΜάρκοςΚαραμέρης $P$ is not one of the given points. Since a finite set of lines does not exhaust the plane, there are plenty of possible choices.
            $endgroup$
            – FredH
            Mar 24 at 2:48










          • $begingroup$
            @FredH Ah ok makes perfect sense now!
            $endgroup$
            – Μάρκος Καραμέρης
            Mar 24 at 2:52
















          $begingroup$
          +1 for being slightly faster than me :)
          $endgroup$
          – Severin Schraven
          Mar 24 at 2:31




          $begingroup$
          +1 for being slightly faster than me :)
          $endgroup$
          – Severin Schraven
          Mar 24 at 2:31












          $begingroup$
          Thx ! This is a “oh of course “ moment of me
          $endgroup$
          – athos
          Mar 24 at 2:32




          $begingroup$
          Thx ! This is a “oh of course “ moment of me
          $endgroup$
          – athos
          Mar 24 at 2:32












          $begingroup$
          It is almost trivial but you need to prove the existence of a point $P$ not collinear to the rest, for example consider the case of points all lying on the same line where this property fails. Luckily the orientation method works in that case too and the existence of such an orientation is guaranteed since picking an arbitary axis the angle of the line between any two points form a finite set.
          $endgroup$
          – Μάρκος Καραμέρης
          Mar 24 at 2:46




          $begingroup$
          It is almost trivial but you need to prove the existence of a point $P$ not collinear to the rest, for example consider the case of points all lying on the same line where this property fails. Luckily the orientation method works in that case too and the existence of such an orientation is guaranteed since picking an arbitary axis the angle of the line between any two points form a finite set.
          $endgroup$
          – Μάρκος Καραμέρης
          Mar 24 at 2:46












          $begingroup$
          @ΜάρκοςΚαραμέρης $P$ is not one of the given points. Since a finite set of lines does not exhaust the plane, there are plenty of possible choices.
          $endgroup$
          – FredH
          Mar 24 at 2:48




          $begingroup$
          @ΜάρκοςΚαραμέρης $P$ is not one of the given points. Since a finite set of lines does not exhaust the plane, there are plenty of possible choices.
          $endgroup$
          – FredH
          Mar 24 at 2:48












          $begingroup$
          @FredH Ah ok makes perfect sense now!
          $endgroup$
          – Μάρκος Καραμέρης
          Mar 24 at 2:52





          $begingroup$
          @FredH Ah ok makes perfect sense now!
          $endgroup$
          – Μάρκος Καραμέρης
          Mar 24 at 2:52


















          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.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3160029%2fexisting-of-non-intersecting-rays%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 preserve electronics (computers, tablets and phones) for hundreds of years Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) The network's official Twitter account is up and running again. What content…How might modern humans leave a message for 50,000 years?How would an aquatic race develop computers?How do we make computers care for human life?Keeping supplies for 1000 yearsWhat will cell phones become in 100 years?What body armor protects against a laser?Could a society attain 1800s technology if limited to using copper and bronze?Electricity power (magic) and electronicsScavenging metal resources in post-apocalypse after 100 yearsWhy would precursors create devices that can survive and still work after hundreds of years?

          155 수학 과학 기타 둘러보기 메뉴eh추가해eh문서를 완성해

          Convert JSON to MapSimplest way to convert a string representing JSON array into Java array List of key value pairsHow to take String JSON values into HashMapConvert a JSON String to a HashMapCreating BSON object from JSON stringJSONObject - How to get a value ?Better Map ConstructorReading JSON from Url javaUpdate columns if input values are not null otherwise ignore and keep the existing values of column in databaseHow to store object represented as Json string into Couchbase Lite?Go JSON into MapHow do I efficiently iterate over each entry in a Java Map?Sort a Map<Key, Value> by valuesHow to round a number to n decimal places in JavaCan comments be used in JSON?How do I read / convert an InputStream into a String in Java?How can I pretty-print JSON in a shell script?What is the correct JSON content type?How can I deserialize JSON to a simple Dictionary<string,string> in ASP.NET?Why does Google prepend while(1); to their JSON responses?Parse JSON in JavaScript?