填充凸多边形的近似最小面积矩形和凸容器

Q4 Mathematics

International Journal of Computational Geometry & Applications Pub Date : 2020-12-21 DOI:10.20382/jocg.v8i1a1

H. Alt, M. D. Berg, Christian Knauer

{"title":"填充凸多边形的近似最小面积矩形和凸容器","authors":"H. Alt, M. D. Berg, Christian Knauer","doi":"10.20382/jocg.v8i1a1","DOIUrl":null,"url":null,"abstract":"We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient constant factor approximation algorithms.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"48 1","pages":"1-10"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons\",\"authors\":\"H. Alt, M. D. Berg, Christian Knauer\",\"doi\":\"10.20382/jocg.v8i1a1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient constant factor approximation algorithms.\",\"PeriodicalId\":54969,\"journal\":{\"name\":\"International Journal of Computational Geometry & Applications\",\"volume\":\"48 1\",\"pages\":\"1-10\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20382/jocg.v8i1a1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20382/jocg.v8i1a1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 13

摘要

研究了用平移法求解凸多边形集不相交装箱的最小面积容器问题。特别地，我们考虑轴平行矩形或任意凸集作为容器。对于这两个np困难的优化问题，我们开发了有效的常因子近似算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons

We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient constant factor approximation algorithms.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Computational Geometry & Applications 数学-计算机：理论方法

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms. Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others. Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome. Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.