Reprint of: Weak ε-nets have basis of size

Nabil H. Mustafa, Saurabh Ray

Research output: Contribution to journalArticle

Abstract

Given a set P of n points in Rd and ε> 0, we consider the problem of constructing weak ε-nets for P. We show the following: pick a random sample Q of size O(1/ε log(1/ε)) from P. Then, with constant probability, a weak ε-net of P can be constructed from only the points of Q . This shows that weak ε-nets in Rd can be computed from a subset of P of size O(1/ε log(1/ε)) with only the constant of proportionality depending on the dimension, unlike all previous work where the size of the subset had the dimension in the exponent of 1/ε. However, our final weak ε-nets still have a large size (with the dimension appearing in the exponent of 1/ε).

Original languageEnglish (US)
Pages (from-to)565-571
Number of pages7
JournalComputational Geometry: Theory and Applications
Volume43
Issue number6-7
DOIs
StatePublished - Aug 1 2010

Fingerprint

Exponent
Subset

Keywords

  • Combinatorial geometry
  • Hitting convex sets
  • Weak ε-nets

ASJC Scopus subject areas

  • Geometry and Topology
  • Computer Science Applications
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

Reprint of : Weak ε-nets have basis of size. / Mustafa, Nabil H.; Ray, Saurabh.

In: Computational Geometry: Theory and Applications, Vol. 43, No. 6-7, 01.08.2010, p. 565-571.

Research output: Contribution to journalArticle

@article{1a29f894f63f42edbfb1844844da0825,
title = "Reprint of: Weak ε-nets have basis of size",
abstract = "Given a set P of n points in Rd and ε> 0, we consider the problem of constructing weak ε-nets for P. We show the following: pick a random sample Q of size O(1/ε log(1/ε)) from P. Then, with constant probability, a weak ε-net of P can be constructed from only the points of Q . This shows that weak ε-nets in Rd can be computed from a subset of P of size O(1/ε log(1/ε)) with only the constant of proportionality depending on the dimension, unlike all previous work where the size of the subset had the dimension in the exponent of 1/ε. However, our final weak ε-nets still have a large size (with the dimension appearing in the exponent of 1/ε).",
keywords = "Combinatorial geometry, Hitting convex sets, Weak ε-nets",
author = "Mustafa, {Nabil H.} and Saurabh Ray",
year = "2010",
month = "8",
day = "1",
doi = "10.1016/j.comgeo.2007.02.007",
language = "English (US)",
volume = "43",
pages = "565--571",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",
number = "6-7",

}

TY - JOUR

T1 - Reprint of

T2 - Weak ε-nets have basis of size

AU - Mustafa, Nabil H.

AU - Ray, Saurabh

PY - 2010/8/1

Y1 - 2010/8/1

N2 - Given a set P of n points in Rd and ε> 0, we consider the problem of constructing weak ε-nets for P. We show the following: pick a random sample Q of size O(1/ε log(1/ε)) from P. Then, with constant probability, a weak ε-net of P can be constructed from only the points of Q . This shows that weak ε-nets in Rd can be computed from a subset of P of size O(1/ε log(1/ε)) with only the constant of proportionality depending on the dimension, unlike all previous work where the size of the subset had the dimension in the exponent of 1/ε. However, our final weak ε-nets still have a large size (with the dimension appearing in the exponent of 1/ε).

AB - Given a set P of n points in Rd and ε> 0, we consider the problem of constructing weak ε-nets for P. We show the following: pick a random sample Q of size O(1/ε log(1/ε)) from P. Then, with constant probability, a weak ε-net of P can be constructed from only the points of Q . This shows that weak ε-nets in Rd can be computed from a subset of P of size O(1/ε log(1/ε)) with only the constant of proportionality depending on the dimension, unlike all previous work where the size of the subset had the dimension in the exponent of 1/ε. However, our final weak ε-nets still have a large size (with the dimension appearing in the exponent of 1/ε).

KW - Combinatorial geometry

KW - Hitting convex sets

KW - Weak ε-nets

UR - http://www.scopus.com/inward/record.url?scp=77951879621&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951879621&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2007.02.007

DO - 10.1016/j.comgeo.2007.02.007

M3 - Article

AN - SCOPUS:77951879621

VL - 43

SP - 565

EP - 571

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 6-7

ER -