Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897790 | European Journal of Operational Research | 2013 | 13 Pages |
Abstract
To reduce the complexity of the nesting problem, pairwise clustering is introduced to group congruent polygons together in pairs. Pairwise clustering is done automatically to discover matched features among multiple present polygons. Computational experiments show that the implementation is robust and also reasonably fast. The proposed approach provides significantly better results than the previous state of the art on a wide range of benchmark data instances.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ahmed Elkeran,