Hide-and-Seek: Algorithms for Polygon Walk Problems (Q3010428): 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.1007/978-3-642-20877-5_48
+Normal rank
@@ Property / OpenAlex ID @@
+W1529341441
@@ Property / OpenAlex ID: W1529341441 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945501
@@ Property / cites work: Q4945501 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952719
@@ Property / cites work: Q4952719 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+THE TWO GUARDS PROBLEM
@@ Property / cites work: THE TWO GUARDS PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
+Normal rank
@@ Property / cites work @@
+SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
@@ Property / cites work: SEARCHING A POLYGONAL REGION FROM THE BOUNDARY / rank @@
+Normal rank
@@ Property / cites work @@
+On computing connected components of line segments
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
+Normal rank