Extremal convex polygons inscribed in a given convex polygon

被引:0
|
作者
Kodmon, Csenge Lili [1 ]
Langi, Zsolt [2 ,3 ]
机构
[1] Tech Univ Budapest, Dept Geometry, Egey Jozsef Utca 1, H-1111 Budapest, Hungary
[2] Tech Univ Budapest, MTA BME Morphodynam Res Grp, Egry Jozsef Utca 1, H-1111 Budapest, Hungary
[3] Tech Univ Budapest, Dept Geometry, Egry Jozsef Utca 1, H-1111 Budapest, Hungary
关键词
Convex polygon; Perimeter; Area; Billiard; Dual billiard; ALGORITHM; TRAJECTORIES;
D O I
10.1016/j.comgeo.2021.101844
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A convex polygon Q is inscribed in a convex polygon P if every side of P contains at least one vertex of Q. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex n-gon in O(n) and O(n(3)) time, respectively. We also investigate other variants of this problem. (c) 2021 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页数:10
相关论文
共 50 条