首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Disjoint empty convex pentagons in planar point sets
Authors:Bhaswar B Bhattacharya  Sandip Das
Institution:1. Department of Statistics, Stanford University, Stanford, California, USA
2. Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata, India
Abstract:In this paper we obtain the first non-trivial lower bound on the number of disjoint empty convex pentagons in planar points sets. We show that the number of disjoint empty convex pentagons in any set of n points in the plane, no three on a line, is at least $\left\lfloor {\tfrac{{5n}} {{47}}} \right\rfloor $ . This bound can be further improved to $\tfrac{{3n - 1}} {{28}} $ for infinitely many n.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号