Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016): Difference between revisions

@@ Property / cites work @@
+Q4217293
@@ Property / cites work: Q4217293 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards in-place geometric algorithms and data structures
+Normal rank
@@ Property / cites work @@
+Space-efficient planar convex hull algorithms
@@ Property / cites work: Space-efficient planar convex hull algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotically efficient in-place merging
@@ Property / cites work: Asymptotically efficient in-place merging / rank @@
+Normal rank
@@ Property / cites work @@
+Stable minimum space partitioning in linear time
@@ Property / cites work: Stable minimum space partitioning in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting multisets stably in minimum space
@@ Property / cites work: Sorting multisets stably in minimum space / rank @@
+Normal rank
@@ Property / cites work @@
+On finding the convex hull of a simple polygon
@@ Property / cites work: On finding the convex hull of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+On-line construction of the convex hull of a simple polyline
+Normal rank
@@ Property / cites work @@
+Stable in situ sorting and minimum data movement
@@ Property / cites work: Stable in situ sorting and minimum data movement / rank @@
+Normal rank