A complete and efficient algorithm for the intersection of a general and a convex polyhedron (Q5060124): 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.1007/3-540-57155-8_258
+Normal rank
@@ Property / OpenAlex ID @@
+W1563089099
@@ Property / OpenAlex ID: W1563089099 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3833669
@@ Property / cites work: Q3833669 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3957945
@@ Property / cites work: Q3957945 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding extreme points in three dimensions and solving the post-office problem in the plane
+Normal rank
@@ Property / cites work @@
+Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
+Normal rank
@@ Property / cites work @@
+Q3219752
@@ Property / cites work: Q3219752 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3700833
@@ Property / cites work: Q3700833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4162137
@@ Property / cites work: Q4162137 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5060124