A new O(n$\cdot \log \,n)$ algorithm for computing the intersection of convex polygons (Q1107994): Difference between revisions

@@ 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/0031-3203(87)90067-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1988025634
@@ Property / OpenAlex ID: W1988025634 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Feature Article—The Ellipsoid Method: A Survey
@@ Property / cites work: Feature Article—The Ellipsoid Method: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for the Two-Variable Integer Programming Problem
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for determining the convex hull of a finite planar set
+Normal rank
@@ Property / cites work @@
+Computational results on an algorithm for finding all vertices of a polytope
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
+Normal rank
@@ Property / cites work @@
+Linear Programming in Linear Time When the Dimension Is Fixed
+Normal rank
@@ Property / cites work @@
+Convex hulls of finite sets of points in two and three dimensions
+Normal rank
@@ Property / cites work @@
+Q3776623
@@ Property / cites work: Q3776623 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133127
@@ Property / cites work: Q4133127 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1107994

A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994): Difference between revisions

Latest revision as of 17:46, 18 June 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)