Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography

Sweeney, Paul; Paternoster, Elizabeth Ridenour

doi:10.1057/jors.1992.101

Cited by 206 publications

(38 citation statements)

References 275 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It is well known that one can always choose generating vectors vo and vl for a lattice such that the angle from vo to vt is between 60 and 120 degrees. A modest but very tedious generalization of this result shows that vo and vl can always be chosen to lie either in the range pair [-75, -151, [15,75] A non-overlapping lattice packing has no overlap, and therefore for each (i,j, io,il) E L ¢~,…”

Section: Definition Of Overlap Minimizationmentioning

confidence: 97%

See 1 more Smart Citation

Densest translational lattice packing of non-convex polygons (extended abstract)

Milenkovic

2000

Proceedings of the Sixteenth Annual Symposium on Computational Geometry

View full text Add to dashboard Cite

A translation lattice packin9 of k polygons/'1, P2,/'3,..., Pk is a (non-overlapping) packing of the k polygons which can be replicated without overlap at each point of a lattice iovo + i~v~, where vo and vt are vectors generating the lattice and io and il range over all integers. A densest translational lattice packing is one which minimizes the area [vo x vl I of the fundamental parallelogram. An algorithm and implementation is given for densest translation lattice packing. This algorithm has useful applications in industry, particularly clothing manufacture.

show abstract

Section: Definition Of Overlap Minimizationmentioning

confidence: 97%

“…However, it should be stated that most of the heuristic and meta-heuristic methods for packing are very general in nature and should apply to the lattice packing problem too. There axe a number of surveys of packing/nesting heuristics [3,1,16,4,15,5].…”

Section: Related Workmentioning

confidence: 99%

Densest translational lattice packing of non-convex polygons (extended abstract)

Milenkovic

2000

Proceedings of the Sixteenth Annual Symposium on Computational Geometry

View full text Add to dashboard Cite

show abstract

“…Object-space optimal compaction is known to be NPcomplete 16 . In image-space simple linear packing can be quite effective.…”

Section: The Packing Algorithmmentioning

confidence: 99%

Selective Pixel Transmission for Navigating in Remote Virtual Environments

Mann

Cohen–Or

1997

Computer Graphics Forum

View full text Add to dashboard Cite

This paper presents a technique to improve the performance of a walkthrough in remote virtual environments, where a scene is rendered jointly by the server and the client, in order to reduce the network requirements as much as possible. The client generates novel views by extrapolating a reference view based on the locally available geometric model, while the server transmits data necessary to prevent an accumulation of errors. Within this concept, we show that by transmitting only a selected subset of pixels, the quality of the extrapolated views can be improved while requiring less bandwidth. We focus on the selection process in which the visibility gaps between the reference view and novel view are detected, packed and transmitted compressed to the client.

show abstract

“…Surveys are given in Dyckhoff (1990), Dowsland and Dowsland (1992) and Dyckhoff and Finke (1992). Sweeney and Paternoster (1992) and Dyckhoff and Finke gathered references to more than 400 works.…”

Section: Load All the Boxes Into The Containers In Such A Way The Totmentioning

confidence: 99%

An AND/OR‐graph Approach to the Container Loading Problem

Morábito

Arenalest

1994

Int Trans Operational Res

View full text Add to dashboard Cite

The container loading problem consists of packing boxes of various sizes into available containers in such a way as to optimize an objective function. In this paper we deal with the special case where there is just one available container and the objective is to maximize the total volume (or the total utility value, supposing that each box has a utility value) of the loaded boxes. We firstly present three heuristic solution methods for the unconstrained problem. Two of them solve the original three-dimensional problem by layers and by stacks reducing it into several problems with lower dimensions. The third one consists of representing possible loading patterns as complete paths in an AND/OR-graph. Bounds and heuristics are proposed in order to reduce the solution space. A proper heuristic is also given to treat the constrained problem by using the AND/OR-graph approach. Moreover, computational results are presented by solving a number of examples.

show abstract

Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography

Cited by 206 publications

References 275 publications

Densest translational lattice packing of non-convex polygons (extended abstract)

Densest translational lattice packing of non-convex polygons (extended abstract)

Selective Pixel Transmission for Navigating in Remote Virtual Environments

An AND/OR‐graph Approach to the Container Loading Problem

Contact Info

Product

Resources

About