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

SCG '90 Pub Date : 1990-05-01 DOI:10.1145/98524.98530
J. Matoušek, R. Seidel, E. Welzl
{"title":"How to net a lot with little: small ε-nets for disks and halfspaces","authors":"J. Matoušek, R. Seidel, E. Welzl","doi":"10.1145/98524.98530","DOIUrl":null,"url":null,"abstract":"It is known that in general range spaces of VC-dimension <italic>d</italic> > 1 require <italic>ε</italic>-nets to be of size at least &OHgr;(<italic>d</italic>/<italic>ε</italic> log 1/<italic>ε</italic>). 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 R<supscrpt>3</supscrpt> allow <italic>ε</italic>-nets of size only <italic>&Ogr;</italic>(1/<italic>ε</italic>), which is best possible up to a multiplicative constant. The analogous questions for higher-dimensional spaces remain open.","PeriodicalId":113850,"journal":{"name":"SCG '90","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"127","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SCG '90","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/98524.98530","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 127

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
如何用小的ε-网(用于磁盘和半空间)网到很多东西
已知在vc维d > 1的一般值域空间中,要求ε-nets的大小至少为&OHgr;(d/ε log 1/ε)。我们研究这个一般下界对计算几何中通常出现的特殊范围空间是否有效的问题。我们证明了平面上的圆盘和伪圆盘以及R3中的半空间允许ε-网的大小仅为&Ogr;(1/ε),这是最大可能的乘法常数。高维空间的类似问题仍然是开放的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Linear programming and convex hulls made easy Computing the minimum Hausdorff distance for point sets under translation On solving geometric optimization problems using shortest paths Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams An O(n2log n) time algorithm for the MinMax angle triangulation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1