An improved algorithm for intersecting convex polygons (Q286975): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+U05
@@ Property / Mathematics Subject Classification ID: 68U05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B55
@@ Property / Mathematics Subject Classification ID: 52B55 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6585367
@@ Property / zbMATH DE Number: 6585367 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithms
@@ Property / zbMATH Keywords: algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational geometry
@@ Property / zbMATH Keywords: computational geometry / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convex polygons
@@ Property / zbMATH Keywords: convex polygons / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+A new linear algorithm for intersecting convex polygons
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(96)00195-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2094091137
@@ Property / OpenAlex ID: W2094091137 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:286975