Finding the upper envelope of n line segments in O(n log n) time (Q582095): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(89)90136-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2020590137
@@ Property / OpenAlex ID: W2020590137 / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
+Normal rank
@@ Property / cites work @@
+Visibility of disjoint polygons
@@ Property / cites work: Visibility of disjoint polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Some dynamic computational geometry problems
@@ Property / cites work: Some dynamic computational geometry problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Problem Connected with Differential Equations
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the maximum, merging, and sorting in a parallel computation model
+Normal rank
@@ Property / cites work @@
+Planar realizations of nonlinear Davenport-Schinzel sequences by segments
+Normal rank
@@ Property / Wikidata QID @@
+Q29302733
@@ Property / Wikidata QID: Q29302733 / rank @@
+Normal rank