3
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Finding the upper envelope of n line segments in O(n log n) time

      Information Processing Letters
      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references8

          • Record: found
          • Abstract: not found
          • Article: not found

          Fast Algorithms for Finding Nearest Common Ancestors

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Parallel Merge Sort

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes

                Bookmark

                Author and article information

                Journal
                Information Processing Letters
                Information Processing Letters
                Elsevier BV
                00200190
                December 1989
                December 1989
                : 33
                : 4
                : 169-174
                Article
                10.1016/0020-0190(89)90136-1
                596a9f5f-8b1b-4277-b273-8e90feb2a191
                © 1989

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article