Computing the full visibility graph of a set of line segments (Q1198072): Difference between revisions

@@ Property / author @@
-Stephen K. Wismath
@@ Property / author: Stephen K. Wismath / rank @@
-Normal rank
@@ Property / author @@
+Stephen K. Wismath
@@ Property / author: Stephen K. Wismath / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility of disjoint polygons
@@ Property / cites work: Visibility of disjoint polygons / rank @@
+Normal rank
@@ Property / cites work @@
+An Output-Sensitive Algorithm for Computing Visibility Graphs
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to visibility representations of planar graphs
+Normal rank
@@ Property / cites work @@
+Shortest path solves edge-to-edge visibility in a polygon
+Normal rank
@@ Property / cites work @@
+Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(92)90033-r
+Normal rank
@@ Property / OpenAlex ID @@
+W2090581029
@@ Property / OpenAlex ID: W2090581029 / rank @@
+Normal rank