当前位置:
X-MOL 学术
›
Comput. Geom.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Extremal convex polygons inscribed in a given convex polygon
Computational Geometry ( IF 0.6 ) Pub Date : 2021-11-15 , DOI: 10.1016/j.comgeo.2021.101844 Csenge Lili Ködmön 1 , Zsolt Lángi 2
中文翻译:
内接在给定凸多边形中的极值凸多边形
更新日期:2021-11-16
Computational Geometry ( IF 0.6 ) Pub Date : 2021-11-15 , DOI: 10.1016/j.comgeo.2021.101844 Csenge Lili Ködmön 1 , Zsolt Lángi 2
Affiliation
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 and time, respectively. We also investigate other variants of this problem.
中文翻译:
内接在给定凸多边形中的极值凸多边形
凸多边形Q是在凸多边形内切P如果每一个侧P包含至少一个顶点Q。我们提出了用于寻找内接于任何给定凸n -gon 中的最小面积和最小周长凸多边形的算法 和 时间,分别。我们还调查了这个问题的其他变体。