Minimal convex k-gons containing a given convex polygon

被引:0
|
作者
Zalgaller V.A.
机构
关键词
Convex Polygon; Minimal Area; Minimal Convex;
D O I
10.1023/A:1011373629136
中图分类号
学科分类号
摘要
There is a k-gon of minimal area containing a given convex n-gon (k < n) such that k - 1 sides of the n-gon lie on the sides of the k-gon. All midpoints of the sides of the k-gon belong to the n-gon. © 2001 Plenum Publishing Corporation.
引用
收藏
页码:1272 / 1275
页数:3
相关论文
共 50 条
  • [31] CONVEX HULLS OF UNIFORM SAMPLES FROM A CONVEX POLYGON
    Groeneboom, Piet
    ADVANCES IN APPLIED PROBABILITY, 2012, 44 (02) : 330 - 342
  • [32] MIDPOINTS OF DIAGONALS OF CONVEX N-GONS
    ERDOS, P
    FISHBURN, P
    FUREDI, Z
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1991, 4 (03) : 329 - 341
  • [33] Forced convex n-gons in the plane
    Chung, FRK
    Graham, RL
    DISCRETE & COMPUTATIONAL GEOMETRY, 1998, 19 (03) : 367 - 371
  • [35] SETS WITH NO EMPTY CONVEX 7-GONS
    HORTON, JD
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 1983, 26 (04): : 482 - 484
  • [36] Generating Empty Convex Polygon Randomly from a Subset of Given Point Set
    Mohanty, Manas Kumar
    Sadhu, Sanjib
    Kumar, Niraj
    Pati, Kamaljit
    INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, VOL 1, 2015, 339 : 311 - 318
  • [37] An approximation algorithm for k-center problem on a convex polygon
    Du, Hai
    Xu, Yinfeng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (03) : 504 - 518
  • [38] An approximation algorithm for k-center problem on a convex polygon
    Hai Du
    Yinfeng Xu
    Journal of Combinatorial Optimization, 2014, 27 : 504 - 518
  • [39] A POSTSCRIPT ON DISTANCES IN CONVEX N-GONS
    ERDOS, P
    FISHBURN, P
    DISCRETE & COMPUTATIONAL GEOMETRY, 1994, 11 (01) : 111 - 117
  • [40] EMPTY NON-CONVEX AND CONVEX FOUR-GONS IN RANDOM POINT SETS
    Fabila-Monroy, Ruy
    Huemer, Clemens
    Mitsche, Dieter
    STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2015, 52 (01) : 52 - 64