Compaction and separation algorithms for non-convex polygons and their applications

Research output: Contribution to journalArticle

95 Citations (Scopus)

Abstract

Given a two-dimensional, non-overlapping layout of convex and non-convex polygons, compaction can be thought of as simulating the motion of the polygons resulting from applied 'forces'. By moving many polygons simultaneously, compaction can improve the material utilization of even tightly packed layouts. Compaction is hard: finding the tightest layout that a valid motion can reach is PSPACE-hard, and even compacting to a local optimum can require an exponential number of moves. Our first compaction algorithm uses a new velocity-based optimization model based on existing physical simulation approaches. The performance of this algorithm illustrates that these approaches cannot quickly compact tightly packed layouts. We then present a new position-based optimization model. This model represents the forces as a linear objective function, and it permits direct calculation, via linear programming, of new non-overlapping polygon positions at a local minimum of the objective. The new model yields a translational compaction algorithm that runs two orders of magnitude faster than physical simulation methods. We also consider the problem of separating overlapping polygons using the least amount of motion, prove optimal separation to be NP-complete, and show that our position-based model also yields an efficient algorithm for finding a locally optimal separation. The compaction algorithm has improved cloth utilization of human-generated layouts of trousers and other garments. Given a database of human-generated markers and with an efficient technique for matching, the separation algorithm can automatically generate layouts that approach human performance.

Original languageEnglish (US)
Pages (from-to)539-561
Number of pages23
JournalEuropean Journal of Operational Research
Volume84
Issue number3
DOIs
StatePublished - Aug 3 1995
Externally publishedYes

Fingerprint

Compaction
layout
Polygon
Layout
Physical Simulation
optimization model
Optimization Model
Motion
utilization
Human Performance
simulation
Local Minima
Simulation Methods
Linear Function
Linear programming
performance
Overlapping
Efficient Algorithms
NP-complete problem
Objective function

Keywords

  • Compaction
  • Irregular shapes
  • Minkowski sums
  • Packing
  • Physically based modeling
  • Polygon nesting

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Modeling and Simulation
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Transportation

Cite this

Compaction and separation algorithms for non-convex polygons and their applications. / Li, Zhenyu; Milenkovic, Victor.

In: European Journal of Operational Research, Vol. 84, No. 3, 03.08.1995, p. 539-561.

Research output: Contribution to journalArticle

@article{20d1a3a7ea11477a8c637835037f84df,
title = "Compaction and separation algorithms for non-convex polygons and their applications",
abstract = "Given a two-dimensional, non-overlapping layout of convex and non-convex polygons, compaction can be thought of as simulating the motion of the polygons resulting from applied 'forces'. By moving many polygons simultaneously, compaction can improve the material utilization of even tightly packed layouts. Compaction is hard: finding the tightest layout that a valid motion can reach is PSPACE-hard, and even compacting to a local optimum can require an exponential number of moves. Our first compaction algorithm uses a new velocity-based optimization model based on existing physical simulation approaches. The performance of this algorithm illustrates that these approaches cannot quickly compact tightly packed layouts. We then present a new position-based optimization model. This model represents the forces as a linear objective function, and it permits direct calculation, via linear programming, of new non-overlapping polygon positions at a local minimum of the objective. The new model yields a translational compaction algorithm that runs two orders of magnitude faster than physical simulation methods. We also consider the problem of separating overlapping polygons using the least amount of motion, prove optimal separation to be NP-complete, and show that our position-based model also yields an efficient algorithm for finding a locally optimal separation. The compaction algorithm has improved cloth utilization of human-generated layouts of trousers and other garments. Given a database of human-generated markers and with an efficient technique for matching, the separation algorithm can automatically generate layouts that approach human performance.",
keywords = "Compaction, Irregular shapes, Minkowski sums, Packing, Physically based modeling, Polygon nesting",
author = "Zhenyu Li and Victor Milenkovic",
year = "1995",
month = "8",
day = "3",
doi = "10.1016/0377-2217(95)00021-H",
language = "English (US)",
volume = "84",
pages = "539--561",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Compaction and separation algorithms for non-convex polygons and their applications

AU - Li, Zhenyu

AU - Milenkovic, Victor

PY - 1995/8/3

Y1 - 1995/8/3

N2 - Given a two-dimensional, non-overlapping layout of convex and non-convex polygons, compaction can be thought of as simulating the motion of the polygons resulting from applied 'forces'. By moving many polygons simultaneously, compaction can improve the material utilization of even tightly packed layouts. Compaction is hard: finding the tightest layout that a valid motion can reach is PSPACE-hard, and even compacting to a local optimum can require an exponential number of moves. Our first compaction algorithm uses a new velocity-based optimization model based on existing physical simulation approaches. The performance of this algorithm illustrates that these approaches cannot quickly compact tightly packed layouts. We then present a new position-based optimization model. This model represents the forces as a linear objective function, and it permits direct calculation, via linear programming, of new non-overlapping polygon positions at a local minimum of the objective. The new model yields a translational compaction algorithm that runs two orders of magnitude faster than physical simulation methods. We also consider the problem of separating overlapping polygons using the least amount of motion, prove optimal separation to be NP-complete, and show that our position-based model also yields an efficient algorithm for finding a locally optimal separation. The compaction algorithm has improved cloth utilization of human-generated layouts of trousers and other garments. Given a database of human-generated markers and with an efficient technique for matching, the separation algorithm can automatically generate layouts that approach human performance.

AB - Given a two-dimensional, non-overlapping layout of convex and non-convex polygons, compaction can be thought of as simulating the motion of the polygons resulting from applied 'forces'. By moving many polygons simultaneously, compaction can improve the material utilization of even tightly packed layouts. Compaction is hard: finding the tightest layout that a valid motion can reach is PSPACE-hard, and even compacting to a local optimum can require an exponential number of moves. Our first compaction algorithm uses a new velocity-based optimization model based on existing physical simulation approaches. The performance of this algorithm illustrates that these approaches cannot quickly compact tightly packed layouts. We then present a new position-based optimization model. This model represents the forces as a linear objective function, and it permits direct calculation, via linear programming, of new non-overlapping polygon positions at a local minimum of the objective. The new model yields a translational compaction algorithm that runs two orders of magnitude faster than physical simulation methods. We also consider the problem of separating overlapping polygons using the least amount of motion, prove optimal separation to be NP-complete, and show that our position-based model also yields an efficient algorithm for finding a locally optimal separation. The compaction algorithm has improved cloth utilization of human-generated layouts of trousers and other garments. Given a database of human-generated markers and with an efficient technique for matching, the separation algorithm can automatically generate layouts that approach human performance.

KW - Compaction

KW - Irregular shapes

KW - Minkowski sums

KW - Packing

KW - Physically based modeling

KW - Polygon nesting

UR - http://www.scopus.com/inward/record.url?scp=0029634665&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029634665&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(95)00021-H

DO - 10.1016/0377-2217(95)00021-H

M3 - Article

VL - 84

SP - 539

EP - 561

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -