首页> 外文会议>Annual symposium on Computational geometry;Symposium on Computational geometry >How to net a lot with little: small ε-nets for disks and halfspaces
【24h】

How to net a lot with little: small ε-nets for disks and halfspaces

机译:如何用很少的钱赚很多钱:用于磁盘和半空间的小型ε-net

获取原文

摘要

It is known that in general range spaces of VC-dimension d 1 require ε-nets to be of size at least &OHgr;(d/ε log 1/ε). We investigate the question whether this general lower bound is valid for the special range spaces that typically arise in computational geometry. We show that disks and pseudo-disks in the plane as well as halfspaces in R3 allow ε-nets of size only &Ogr;(1/ε), which is best possible up to a multiplicative constant. The analogous questions for higher-dimensional spaces remain open.

机译:

众所周知,在VC维 d > 1的一般范围空间中,ε网的大小至少为&OHgr;( d < / ITALIC> / ε日志1 / ε)。我们调查了这个一般的下界是否对通常在计算几何中出现的特殊范围空间有效。我们显示了平面中的磁盘和伪磁盘以及R 3 中的半空间仅允许ε网络的大小为&Ogr; (1 / ε),最好是乘数常量。高维空间的类似问题仍然没有解决。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号