ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (Q4818554): Difference between revisions

@@ Property / Wikidata QID @@
+Q56970708
@@ Property / Wikidata QID: Q56970708 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Ray shooting in polygons using geodesic triangulations
+Normal rank
@@ Property / cites work @@
+Visibility and intersection problems in plane geometry
+Normal rank
@@ Property / cites work @@
+A linear algorithm for computing the visibility polygon from a point
+Normal rank
@@ Property / cites work @@
+Fast triangulation of the plane with respect to simple polygons
+Normal rank
@@ Property / cites work @@
+Decomposing a Polygon into Simpler Components
@@ Property / cites work: Decomposing a Polygon into Simpler Components / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0218195902000803
+Normal rank
@@ Property / OpenAlex ID @@
+W2109083408
@@ Property / OpenAlex ID: W2109083408 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4818554