Two personification strategies for solving circles packing problem
From MaRDI portal
Publication:1974210
DOI10.1007/BF02916995zbMath0956.68555MaRDI QIDQ1974210
Publication date: 7 May 2000
Published in: Science in China. Series E (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (7)
Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ Quasi-physical global optimization method for solving the equal circle packing problem ⋮ A new heuristic algorithm for the circular packing problem with equilibrium constraints ⋮ A new heuristic algorithm for rectangle packing ⋮ Approximation schemes for covering and packing problems in image processing and VLSI ⋮ Global optimization method for finding dense packings of equal circles in a circle ⋮ Constrained circles packing test problems: all the optimal solutions known
Cites Work
This page was built for publication: Two personification strategies for solving circles packing problem