Reconstruction of Weakly Simple Polygons from Their Edges (Q3177902): Difference between revisions

@@ Property / author @@
+Csaba D. Tóth
@@ Property / author: Csaba D. Tóth / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00361
@@ Property / arXiv ID: 1610.00361 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing weakly simple polygons
@@ Property / cites work: Recognizing weakly simple polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing polygons from scanner data
@@ Property / cites work: Reconstructing polygons from scanner data / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting Weakly Simple Polygons
@@ Property / cites work: Detecting Weakly Simple Polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+On embedding a cycle in a plane graph
@@ Property / cites work: On embedding a cycle in a plane graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
+Normal rank
@@ Property / cites work @@
+A polygon is determined by its angles
@@ Property / cites work: A polygon is determined by its angles / rank @@
+Normal rank
@@ Property / cites work @@
+Q3971282
@@ Property / cites work: Q3971282 / rank @@
+Normal rank
@@ Property / cites work @@
+Segment endpoint visibility graphs are Hamiltonian
+Normal rank
@@ Property / cites work @@
+The complexity of detecting crossingfree configurations in the plane
+Normal rank
@@ Property / cites work @@
+Q3796758
@@ Property / cites work: Q3796758 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5358292
@@ Property / cites work: Q5358292 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Simple Circuits from a Set of Line Segments is NP-Complete
+Normal rank
@@ Property / cites work @@
+Connectivity augmentation in planar straight line graphs
+Normal rank
@@ Property / cites work @@
+On a counterexample to a conjecture of Mirzaian
@@ Property / cites work: On a counterexample to a conjecture of Mirzaian / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3101770330
@@ Property / OpenAlex ID: W3101770330 / rank @@
+Normal rank