Untitled

Hopper, E. Mitchell; Turton, Brian

doi:10.1023/a:1012590107280

Cited by 159 publications

(19 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The strip packing problem is a popular variant of the 2D cutting and packing problem which has only one large rectangular object with fixed width, its length is variable and has to be minimized after placing all the small pieces (some approaches and reviews by Dowsland and Dowsland 1995;Hopper and Turton 2001;Burke et al 2006). A variation of this typical strip packing problem consists on nesting irregular pieces in one large irregular object (examples by Lamousin and Dobson 1996;Lamousin and Waggenspack 1997;Whelan and Batchelor 1992;Ramesh 2001).…”

Section: The 2d Irregular Bin Packing Problemmentioning

confidence: 99%

An effective heuristic for the two-dimensional irregular bin packing problem

et al. 2013

View full text Add to dashboard Cite

This paper proposes an adaptation, to the two-dimensional irregular bin packing problem of the Djang and Finch heuristic (DJD), originally designed for the one-dimensional bin packing problem. In the two-dimensional case, not only is it the case that the piece's size is important but its shape also has a significant influence. Therefore, DJD as a selection heuristic has to be paired with a placement heuristic to completely construct a solution to the underlying packing problem. A successful adaptation of the DJD requires a routine to reduce computational costs, which is also proposed and successfully tested in this paper. Results, on a wide variety of instance types with convex polygons, are found to be significantly better than those produced by more conventional selection heuristics.

show abstract

Section: The 2d Irregular Bin Packing Problemmentioning

confidence: 99%

An effective heuristic for the two-dimensional irregular bin packing problem

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Heuristic algorithms have been the alternative adopted to approximate large CSP problems [HT01]. In this work we propose a variant of the heuristic proposed by Baker et al [BCR80], which is efficient enough to enable interactive manipulation of word clouds and flexible enough to allow incorporating the semantic relationship among words during the word cloud construction process.…”

Section: The Optimization Problemmentioning

confidence: 99%

Semantic Wordification of Document Collections

Paulovich¹,

Toledo²,

Telles

et al. 2012

Computer Graphics Forum

View full text Add to dashboard Cite

Word clouds have become one of the most widely accepted visual resources for document analysis and visualization, motivating the development of several methods for building layouts of keywords extracted from textual data. Existing methods are effective to demonstrate content, but are not capable of preserving semantic relationships among keywords while still linking the word cloud to the underlying document groups that generated them. Such representation is highly desirable for exploratory analysis of document collections. In this paper we present a novel approach to build document clouds, named ProjCloud that aim at solving both semantical layouts and linking with document sets. ProjCloud generates a semantically consistent layout from a set of documents. Through a multidimensional projection, it is possible to visualize the neighborhood relationship between highly related documents and their corresponding word clouds simultaneously. Additionally, we propose a new algorithm for building word clouds inside polygons, which employs spectral sorting to maintain the semantic relationship among words. The effectiveness and flexibility of our methodology is confirmed when comparisons are made to existing methods. The technique automatically constructs projection based layouts the user may choose to examine in the form of the point clouds or corresponding word clouds, allowing a high degree of control over the exploratory process.

show abstract

“…Dyckhoff (Dyckhoff, 1990) made a typology of the cutting and packing problems in detail, and Wäscher (Wäscher et al, 2007) improved the typology later. Hopper (Hopper and Turton, 1999;Hopper and Turton, 2001a;Hopper and Turton, 2001b) investigated the application of metaheuristic and heuristic algorithms in 2D and 3D packing problems. Lodi (Lodi et al, 2002a;Lodi et al, 2002b) reviewed algorithms proposed in the 1990s of 2D packing problems.…”

Section: Introductionmentioning

confidence: 99%

Two-dimensional irregular packing problems: A review

Guo

et al. 2022

Front. Mech. Eng.

View full text Add to dashboard Cite

Two-dimensional (2D) irregular packing problems are widespread in manufacturing industries such as shipbuilding, metalworking, automotive production, aerospace, clothing and furniture manufacturing. Research on 2D irregular packing problems is essential for improving material utilization and industrial automation. Much research has been conducted on this problem with significant research results and certain algorithms. The work has made important contributions to solving practical problems. This paper reviews recent advances in the domain of 2D irregular packing problems based on a variety of research papers. We first introduce the basic concept and research background of 2D irregular packing problems and then summarize algorithms and strategies that have been proposed for the problems in recent years. Conclusion summarize development trends and research hotspots of typical 2D irregular shape packing problems. We hope that this review could provide guidance for researchers in the field of 2D irregular packing.

show abstract

Untitled

Cited by 159 publications

References 53 publications

An effective heuristic for the two-dimensional irregular bin packing problem

An effective heuristic for the two-dimensional irregular bin packing problem

Semantic Wordification of Document Collections

Two-dimensional irregular packing problems: A review

Contact Info

Product

Resources

About