A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums (Q2384604): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2006.02.026
+Normal rank
@@ Property / OpenAlex ID @@
+W1993091251
@@ Property / OpenAlex ID: W1993091251 / rank @@
+Normal rank
@@ Property / cites work @@
+A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
+Normal rank
@@ Property / cites work @@
+An algebra of polygons through the notion of negative shapes
+Normal rank
@@ Property / cites work @@
+The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
+Normal rank
@@ Property / cites work @@
+Computational Geometry in C
@@ Property / cites work: Computational Geometry in C / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947407
@@ Property / cites work: Q4947407 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete and robust no-fit polygon generation for the irregular stock cutting problem
+Normal rank
@@ Property / cites work @@
+Q3154416
@@ Property / cites work: Q3154416 / rank @@
+Normal rank
@@ Property / cites work @@
+Compaction and separation algorithms for non-convex polygons and their applications
+Normal rank
@@ Property / cites work @@
+Polygon decomposition for efficient construction of Minkowski sums
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for intersecting line segments in the plane
+Normal rank