Hamish T. Dean

Learn More
A manufacturer of electrical cable needs to pack drums and pallets of cable into standard shipping containers for exporting overseas. Packing is done in such a way as to minimise the number of containers used. A three dimensional packing heuristic is developed to solve this problem. The packing plans prepared manually were compared to the plans obtained(More)
The no-fit polygon (NFP) is the set of feasible locations that one polygon may take with respect to another polygon, such that the polygons do not overlap. Feasible locations are required for most of the solutions to two-dimensional packing problems, and also for other problems such as robot motion planning. Efficient methods to calculate the NFP of two(More)