An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane (Q1806579): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3134474
@@ Property / cites work: Q3134474 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091004
@@ Property / cites work: Q4091004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4295776
@@ Property / cites work: Q4295776 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving related two- and three-dimensional linear programming problems in logarithmic time
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0898-1221(98)00128-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1967868261
@@ Property / OpenAlex ID: W1967868261 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1806579