Efficient folding algorithms for convex polyhedra (Q6142354): Difference between revisions

@@ Property / DOI @@
-.1007/s00454-022-00415-7
@@ Property / DOI: 10.1007/s00454-022-00415-7 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q114229294
@@ Property / Wikidata QID: Q114229294 / rank @@
+Normal rank
@@ Property / cites work @@
+Tile-Makers and Semi-Tile-Makers
@@ Property / cites work: Tile-Makers and Semi-Tile-Makers / rank @@
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5427478
@@ Property / cites work: Q5427478 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithm for Box Folding
@@ Property / cites work: Efficient Algorithm for Box Folding / rank @@
+Normal rank
@@ Property / cites work @@
+Will It Tile? Try the Conway Criterion!
@@ Property / cites work: Will It Tile? Try the Conway Criterion! / rank @@
+Normal rank
@@ Property / cites work @@
+Common developments of three incongruent boxes of area 30
+Normal rank
@@ Property / DOI @@
+.1007/S00454-022-00415-7
@@ Property / DOI: 10.1007/S00454-022-00415-7 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6142354