Triangulations, visibility graph and reflex vertices of a simple polygon (Q1126249): Difference between revisions

@@ Property / author @@
+Ferran Hurtado
@@ Property / author: Ferran Hurtado / rank @@
+Normal rank
@@ Property / author @@
+Marc Noy
@@ Property / author: Marc Noy / rank @@
+Normal rank
@@ 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.1016/0925-7721(95)00027-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2045911857
@@ Property / OpenAlex ID: W2045911857 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3750120
@@ Property / cites work: Q3750120 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5632617
@@ Property / cites work: Q5632617 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3670558
@@ Property / cites work: Q3670558 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4940023
@@ Property / cites work: Q4940023 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a Polygon into Simpler Components
@@ Property / cites work: Decomposing a Polygon into Simpler Components / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
+Normal rank
@@ Property / cites work @@
+Q3995745
@@ Property / cites work: Q3995745 / rank @@
+Normal rank