Reprint of: Memory-constrained algorithms for simple polygons (Q390167): Difference between revisions

@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q2968076
@@ Property / cites work: Q2968076 / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons
+Normal rank
@@ Property / cites work @@
+Space-Time Trade-offs for Stack-Based Algorithms
@@ Property / cites work: Space-Time Trade-offs for Stack-Based Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Visibility Polygon Using Few Variables
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
+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 @@
+Multi-pass geometric algorithms
@@ Property / cites work: Multi-pass geometric algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Comparison-based time-space lower bounds for selection
+Normal rank
@@ Property / cites work @@
+Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulation and shape-complexity
@@ Property / cites work: Triangulation and shape-complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Slicing an ear using prune-and-search
@@ Property / cites work: Slicing an ear using prune-and-search / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating Simple Polygons and Equivalent Problems
+Normal rank
@@ Property / cites work @@
+Upper bounds for time-space trade-offs in sorting and selection
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon
@@ Property / cites work: Triangulating a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal shortest path queries in a simple polygon
@@ Property / cites work: Optimal shortest path queries in a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Selection and sorting with limited storage
@@ Property / cites work: Selection and sorting with limited storage / rank @@
+Normal rank
@@ Property / cites work @@
+Selection from read-only memory and sorting with minimum data movement
+Normal rank
@@ Property / cites work @@
+Q3425115
@@ Property / cites work: Q3425115 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for time-space tradeoffs for selection with limited storage
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank