Sub-quadratic algorithm for finding the intersections between two sets of spherical arcs

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












Is there an algorithm that can find the intersections between two sets of spherical great-circle arcs (on the same sphere) with an worst-case runtime complexity better than the $O(n × m)$ brute-force algorithm? Intersections between arcs in the same set are irrelevant, I only need to find the intersections between two arcs in different sets.



The arcs are defined by two points on the sphere, taking the shorter great-circle path (the one with length < π, assume none of the pairs of points are antipodal). The arcs are not necessarily the same length.







share|cite|improve this question
























    up vote
    0
    down vote

    favorite












    Is there an algorithm that can find the intersections between two sets of spherical great-circle arcs (on the same sphere) with an worst-case runtime complexity better than the $O(n × m)$ brute-force algorithm? Intersections between arcs in the same set are irrelevant, I only need to find the intersections between two arcs in different sets.



    The arcs are defined by two points on the sphere, taking the shorter great-circle path (the one with length < π, assume none of the pairs of points are antipodal). The arcs are not necessarily the same length.







    share|cite|improve this question






















      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      Is there an algorithm that can find the intersections between two sets of spherical great-circle arcs (on the same sphere) with an worst-case runtime complexity better than the $O(n × m)$ brute-force algorithm? Intersections between arcs in the same set are irrelevant, I only need to find the intersections between two arcs in different sets.



      The arcs are defined by two points on the sphere, taking the shorter great-circle path (the one with length < π, assume none of the pairs of points are antipodal). The arcs are not necessarily the same length.







      share|cite|improve this question












      Is there an algorithm that can find the intersections between two sets of spherical great-circle arcs (on the same sphere) with an worst-case runtime complexity better than the $O(n × m)$ brute-force algorithm? Intersections between arcs in the same set are irrelevant, I only need to find the intersections between two arcs in different sets.



      The arcs are defined by two points on the sphere, taking the shorter great-circle path (the one with length < π, assume none of the pairs of points are antipodal). The arcs are not necessarily the same length.









      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Aug 17 at 7:31









      taylor swift

      396210




      396210

























          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: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          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%2f2885499%2fsub-quadratic-algorithm-for-finding-the-intersections-between-two-sets-of-spheri%23new-answer', 'question_page');

          );

          Post as a guest



































          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes










           

          draft saved


          draft discarded


























           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2885499%2fsub-quadratic-algorithm-for-finding-the-intersections-between-two-sets-of-spheri%23new-answer', 'question_page');

          );

          Post as a guest













































































          這個網誌中的熱門文章

          How to combine Bézier curves to a surface?

          Why am i infinitely getting the same tweet with the Twitter Search API?

          Carbon dioxide