VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ryu, Joonghyun | - |
dc.contributor.author | Lee, Mokwon | - |
dc.contributor.author | Kim, Donguk | - |
dc.contributor.author | Kallrath, Josef | - |
dc.contributor.author | Sugihara, Kokichi | - |
dc.contributor.author | Kim, Deok-Soo | - |
dc.date.accessioned | 2021-08-02T09:26:37Z | - |
dc.date.available | 2021-08-02T09:26:37Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2020-06 | - |
dc.identifier.issn | 0096-3003 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/9730 | - |
dc.description.abstract | The disk packing problem (DPP) is to find an arrangement of circular disks within the smallest possible container without any overlap. We discuss a DPP for polysized disks in a circular container. DPP is known NP-hard and reported algorithms are slow for finding good solutions even with the problem instances of small to moderate sizes. Here we introduce a heuristic algorithm which finds sufficiently good solutions in realtime for small to moderate-sized problem instances and in pseudo-realtime for large problem instances. The proposed algorithm, VOROPACK-D, takes advantage of the spatial reasoning property of Voronoi diagram and finds an approximate solution of DPP in O(nlog n) time with O(n) memory by making incremental placement of n disks in the order of non-increasing disk size, thus called a big-disk-first method. The location of a placement is determined using the Voronoi diagram of already-placed disks. If needed, we further enhance a big-disk-first realtime packing solution using the Shrink-and-Shake algorithm by taking an additional O(Mn-2) time for each shrinkage where M << n is the number of protruding disks for each shrinkage. Experimental results show that the proposed algorithm is faster than other reported ones by several orders of magnitude, particularly for large problem instances. Theoretical observations are verified and validated by a thorough experiment. This study suggests that Voronoi diagram might be useful for solving other hard optimization problems related with empty spaces. VOROPACK-D is freely available at Voronoi Diagram Research Center (http://voronoi.hanyang.ac.kr/software/voropack-d). | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.title | VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Deok-Soo | - |
dc.identifier.doi | 10.1016/j.amc.2020.125076 | - |
dc.identifier.scopusid | 2-s2.0-85079242555 | - |
dc.identifier.wosid | 000518428200015 | - |
dc.identifier.bibliographicCitation | APPLIED MATHEMATICS AND COMPUTATION, v.375, pp.1 - 29 | - |
dc.relation.isPartOf | APPLIED MATHEMATICS AND COMPUTATION | - |
dc.citation.title | APPLIED MATHEMATICS AND COMPUTATION | - |
dc.citation.volume | 375 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 29 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | EQUAL CIRCLES | - |
dc.subject.keywordPlus | CONGRUENT CIRCLES | - |
dc.subject.keywordPlus | SEARCH ALGORITHM | - |
dc.subject.keywordPlus | UNEQUAL CIRCLES | - |
dc.subject.keywordPlus | POINT SET | - |
dc.subject.keywordPlus | SPHERES | - |
dc.subject.keywordPlus | ELLIPSOIDS | - |
dc.subject.keywordPlus | LARGER | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordAuthor | Tessellation | - |
dc.subject.keywordAuthor | NP-hard | - |
dc.subject.keywordAuthor | Heuristic | - |
dc.subject.keywordAuthor | Optimization | - |
dc.subject.keywordAuthor | Computational geometry | - |
dc.subject.keywordAuthor | Monotone convergence | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S009630032030045X?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.