Improved algorithm for the widest empty 1-corner corridor (Q989575): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2009.06.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2068200552
@@ Property / OpenAlex ID: W2068200552 / rank @@
+Normal rank
@@ Property / cites work @@
+On finding widest empty curved corridors
@@ Property / cites work: On finding widest empty curved corridors / rank @@
+Normal rank
@@ Property / cites work @@
+Widest empty L-shaped corridor
@@ Property / cites work: Widest empty L-shaped corridor / rank @@
+Normal rank
@@ Property / cites work @@
+The K-dense corridor problems
@@ Property / cites work: The K-dense corridor problems / rank @@
+Normal rank
@@ Property / cites work @@
+Computing obnoxious 1-corner polygonal chains
@@ Property / cites work: Computing obnoxious 1-corner polygonal chains / rank @@
+Normal rank
@@ Property / cites work @@
+On finding a widest empty 1-corner corridor
@@ Property / cites work: On finding a widest empty 1-corner corridor / rank @@
+Normal rank
@@ Property / cites work @@
+Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
+Normal rank
@@ Property / cites work @@
+The power of geometric duality revisited
@@ Property / cites work: The power of geometric duality revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamically maintaining the widest \(k\)-dense corridor
+Normal rank
@@ Property / cites work @@
+The widest k-dense corridor problems
@@ Property / cites work: The widest k-dense corridor problems / rank @@
+Normal rank