Topologically sweeping visibility complexes via pseudotriangulations (Q1816465): Difference between revisions

@@ Property / author @@
-Michel Pocchiola
@@ Property / author: Michel Pocchiola / rank @@
-Normal rank
@@ Property / author @@
-Gert Vegter
@@ Property / author: Gert Vegter / rank @@
-Normal rank
@@ Property / author @@
+Michel Pocchiola
@@ Property / author: Michel Pocchiola / rank @@
+Normal rank
@@ Property / author @@
+Gert Vegter
@@ Property / author: Gert Vegter / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Can visibility graphs be represented compactly?
@@ Property / cites work: Can visibility graphs be represented compactly? / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility of disjoint polygons
@@ Property / cites work: Visibility of disjoint polygons / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for intersecting line segments in the plane
+Normal rank
@@ Property / cites work @@
+DISTANCE VISIBILITY GRAPHS
@@ Property / cites work: DISTANCE VISIBILITY GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+Topologically sweeping an arrangement
@@ Property / cites work: Topologically sweeping an arrangement / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+An Output-Sensitive Algorithm for Computing Visibility Graphs
+Normal rank
@@ Property / cites work @@
+An optimal visibility graph algorithm for triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Sorting jordan sequences in linear time using level-linked search trees
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5485626
@@ Property / cites work: Q5485626 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedoids
@@ Property / cites work: Greedoids / rank @@
+Normal rank
@@ Property / cites work @@
+Q4309957
@@ Property / cites work: Q4309957 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219751
@@ Property / cites work: Q3219751 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3998244
@@ Property / cites work: Q3998244 / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTATIONAL GEOMETRY COLUMN 18
@@ Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 18 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal tangent visibility graphs
@@ Property / cites work: Minimal tangent visibility graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Time and space efficient algorithms for shortest paths between convex polygons
+Normal rank
@@ Property / cites work @@
+Q3748279
@@ Property / cites work: Q3748279 / 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
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02712876
+Normal rank
@@ Property / OpenAlex ID @@
+W2147097381
@@ Property / OpenAlex ID: W2147097381 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1816465