Minimal tangent visibility graphs (Q1924714): Difference between revisions

@@ 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 @@
+Minimal visibility graphs
@@ Property / cites work: Minimal visibility graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4071773
@@ Property / cites work: Q4071773 / rank @@
+Normal rank
@@ Property / cites work @@
+Topologically sweeping an arrangement
@@ Property / cites work: Topologically sweeping an arrangement / rank @@
+Normal rank
@@ Property / cites work @@
+An Output-Sensitive Algorithm for Computing Visibility Graphs
+Normal rank
@@ Property / cites work @@
+Q3138746
@@ Property / cites work: Q3138746 / rank @@
+Normal rank
@@ Property / cites work @@
+Rotation and Winding Numbers for Planar Polygons and Curves
+Normal rank
@@ Property / cites work @@
+Theory of Maps on Orientable Surfaces
@@ Property / cites work: Theory of Maps on Orientable Surfaces / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTATIONAL GEOMETRY COLUMN 18
@@ Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 18 / rank @@
+Normal rank
@@ Property / cites work @@
+Topologically sweeping visibility complexes via pseudotriangulations
+Normal rank
@@ Property / cites work @@
+Shortest paths in the plane with convex polygonal obstacles
+Normal rank
@@ Property / cites work @@
+Time and space efficient algorithms for shortest paths between convex polygons
+Normal rank
@@ Property / cites work @@
+A tight lower bound on the size of visibility graphs
+Normal rank
@@ Property / cites work @@
+A note on minimal visibility graphs
@@ Property / cites work: A note on minimal visibility graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing sparse visibility graphs
+Normal rank
@@ Property / cites work @@
+Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
+Normal rank