APPROXIMATING MINIMUM-AREA RECTANGULAR AND CONVEX CONTAINERS FOR PACKING CONVEX POLYGONS (vol 8, pg 1, 2017)

被引：0
|
作者：
Alt, Helmut [1 ]
de Berg, Mark [2 ]
Knauer, Christian [3 ]
机构：
[1] Free Univ Berlin, Inst Comp Sci, Berlin, Germany
[2] TU Eindhoven, Dept Comp Sci, Eindhoven, Netherlands
[3] Univ Bayreuth, Inst Angew Informat, Bayreuth, Germany
来源：
JOURNAL OF COMPUTATIONAL GEOMETRY | 2020年 / 11卷 / 01期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：653 / 655
页数：3
相关论文
共 4 条
  • [1] Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
    Alt, Helmut
    de Berg, Mark
    Knauer, Christian
    ALGORITHMS - ESA 2015, 2015, 9294 : 25 - 34
  • [2] Minimum area convex packing of two convex polygons
    Tang, K
    Wang, CCL
    Chen, DZ
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2006, 16 (01) : 41 - 74
  • [3] An algorithm to find maximum area polygons circumscribed about a convex polygon (vol 255, pg 98, 2019)
    Ausserhofer, Markus
    Dann, Susanna
    Langi, Zsolt
    Toth, Geza
    DISCRETE APPLIED MATHEMATICS, 2024, 353 : 222 - 226
  • [4] Survey of convex optimization for aerospace applications (vol 1, pg 23, 2017)
    Liu, X.
    ASTRODYNAMICS, 2022, 6 (04) : 442 - 442
1