Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions
Given a finite point set $P$ in ${\mathbb R}^d$, and $\epsilon>0$ we say that $N\subseteq{ \mathbb R}^d$ is a weak $\epsilon$-net if it pierces every convex set $K$ with $|K\cap P|\geq \epsilon |P|$. We show that for any finite point set in dimension $d\geq 3$, and any $\epsilon>0$, one can co...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Rubin, Natan |
description | Given a finite point set $P$ in ${\mathbb R}^d$, and $\epsilon>0$ we say that
$N\subseteq{ \mathbb R}^d$ is a weak $\epsilon$-net if it pierces every convex
set $K$ with $|K\cap P|\geq \epsilon |P|$. We show that for any finite point
set in dimension $d\geq 3$, and any $\epsilon>0$, one can construct a weak
$\epsilon$-net whose cardinality is $\displaystyle
O^*\left(\frac{1}{\epsilon^{2.558}}\right)$ in dimension $d=3$, and
$\displaystyle o\left(\frac{1}{\epsilon^{d-1/2}}\right)$ in all dimensions
$d\geq 4$.
To be precise, our weak $\epsilon$-net has cardinality $\displaystyle
O\left(\frac{1}{\epsilon^{\alpha_d+\gamma}}\right)$ for any $\gamma>0$, with
$$
\alpha_d=
\left\{
\begin{array}{l}
2.558 & \text{if} \ d=3
\\3.48 & \text{if} \ d=4
\\\left(d+\sqrt{d^2-2d}\right)/2 & \text{if} \ d\geq 5.
\end{array}\right\}
$$
This is the first significant improvement of the bound of $\displaystyle
\tilde{O}\left(\frac{1}{\epsilon^d}\right)$ that was obtained in 1993 by
Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point
sets in dimension $d\geq 3$. |
doi_str_mv | 10.48550/arxiv.2104.12654 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2104_12654</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2104_12654</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-156f1b2ba1e14d98c91d2a1295b6f8f3ac461e989f1511089b29604b14b301313</originalsourceid><addsrcrecordid>eNotj8tuAiEYRtm4MLYP4Kq8wIz83ITuWq9NjF3UpMsJOKBEBQPW1LfXWldn8-XkOwj1gdRcCUEGJv-Gc02B8BqoFLyLXr9OOcWNy_g9_cS2YJ8y_nZmhyfHEvYpVkt3KjhEPA-b7W02DgcXS0ixPKGON_vinh_sodV0shrNq8Xn7GP0tqiMHPIKhPRgqTXggLdarTW01ADVwkqvPDNrLsFppT0IAKK0pVoSboFbRoAB66GXf-39fHPM4WDypfmLaO4R7Aq2KkAK</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions</title><source>arXiv.org</source><creator>Rubin, Natan</creator><creatorcontrib>Rubin, Natan</creatorcontrib><description>Given a finite point set $P$ in ${\mathbb R}^d$, and $\epsilon>0$ we say that
$N\subseteq{ \mathbb R}^d$ is a weak $\epsilon$-net if it pierces every convex
set $K$ with $|K\cap P|\geq \epsilon |P|$. We show that for any finite point
set in dimension $d\geq 3$, and any $\epsilon>0$, one can construct a weak
$\epsilon$-net whose cardinality is $\displaystyle
O^*\left(\frac{1}{\epsilon^{2.558}}\right)$ in dimension $d=3$, and
$\displaystyle o\left(\frac{1}{\epsilon^{d-1/2}}\right)$ in all dimensions
$d\geq 4$.
To be precise, our weak $\epsilon$-net has cardinality $\displaystyle
O\left(\frac{1}{\epsilon^{\alpha_d+\gamma}}\right)$ for any $\gamma>0$, with
$$
\alpha_d=
\left\{
\begin{array}{l}
2.558 & \text{if} \ d=3
\\3.48 & \text{if} \ d=4
\\\left(d+\sqrt{d^2-2d}\right)/2 & \text{if} \ d\geq 5.
\end{array}\right\}
$$
This is the first significant improvement of the bound of $\displaystyle
\tilde{O}\left(\frac{1}{\epsilon^d}\right)$ that was obtained in 1993 by
Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point
sets in dimension $d\geq 3$.</description><identifier>DOI: 10.48550/arxiv.2104.12654</identifier><language>eng</language><subject>Computer Science - Computational Geometry ; Mathematics - Combinatorics</subject><creationdate>2021-04</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2104.12654$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2104.12654$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Rubin, Natan</creatorcontrib><title>Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions</title><description>Given a finite point set $P$ in ${\mathbb R}^d$, and $\epsilon>0$ we say that
$N\subseteq{ \mathbb R}^d$ is a weak $\epsilon$-net if it pierces every convex
set $K$ with $|K\cap P|\geq \epsilon |P|$. We show that for any finite point
set in dimension $d\geq 3$, and any $\epsilon>0$, one can construct a weak
$\epsilon$-net whose cardinality is $\displaystyle
O^*\left(\frac{1}{\epsilon^{2.558}}\right)$ in dimension $d=3$, and
$\displaystyle o\left(\frac{1}{\epsilon^{d-1/2}}\right)$ in all dimensions
$d\geq 4$.
To be precise, our weak $\epsilon$-net has cardinality $\displaystyle
O\left(\frac{1}{\epsilon^{\alpha_d+\gamma}}\right)$ for any $\gamma>0$, with
$$
\alpha_d=
\left\{
\begin{array}{l}
2.558 & \text{if} \ d=3
\\3.48 & \text{if} \ d=4
\\\left(d+\sqrt{d^2-2d}\right)/2 & \text{if} \ d\geq 5.
\end{array}\right\}
$$
This is the first significant improvement of the bound of $\displaystyle
\tilde{O}\left(\frac{1}{\epsilon^d}\right)$ that was obtained in 1993 by
Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point
sets in dimension $d\geq 3$.</description><subject>Computer Science - Computational Geometry</subject><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tuAiEYRtm4MLYP4Kq8wIz83ITuWq9NjF3UpMsJOKBEBQPW1LfXWldn8-XkOwj1gdRcCUEGJv-Gc02B8BqoFLyLXr9OOcWNy_g9_cS2YJ8y_nZmhyfHEvYpVkt3KjhEPA-b7W02DgcXS0ixPKGON_vinh_sodV0shrNq8Xn7GP0tqiMHPIKhPRgqTXggLdarTW01ADVwkqvPDNrLsFppT0IAKK0pVoSboFbRoAB66GXf-39fHPM4WDypfmLaO4R7Aq2KkAK</recordid><startdate>20210426</startdate><enddate>20210426</enddate><creator>Rubin, Natan</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20210426</creationdate><title>Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions</title><author>Rubin, Natan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-156f1b2ba1e14d98c91d2a1295b6f8f3ac461e989f1511089b29604b14b301313</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Computational Geometry</topic><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Rubin, Natan</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rubin, Natan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions</atitle><date>2021-04-26</date><risdate>2021</risdate><abstract>Given a finite point set $P$ in ${\mathbb R}^d$, and $\epsilon>0$ we say that
$N\subseteq{ \mathbb R}^d$ is a weak $\epsilon$-net if it pierces every convex
set $K$ with $|K\cap P|\geq \epsilon |P|$. We show that for any finite point
set in dimension $d\geq 3$, and any $\epsilon>0$, one can construct a weak
$\epsilon$-net whose cardinality is $\displaystyle
O^*\left(\frac{1}{\epsilon^{2.558}}\right)$ in dimension $d=3$, and
$\displaystyle o\left(\frac{1}{\epsilon^{d-1/2}}\right)$ in all dimensions
$d\geq 4$.
To be precise, our weak $\epsilon$-net has cardinality $\displaystyle
O\left(\frac{1}{\epsilon^{\alpha_d+\gamma}}\right)$ for any $\gamma>0$, with
$$
\alpha_d=
\left\{
\begin{array}{l}
2.558 & \text{if} \ d=3
\\3.48 & \text{if} \ d=4
\\\left(d+\sqrt{d^2-2d}\right)/2 & \text{if} \ d\geq 5.
\end{array}\right\}
$$
This is the first significant improvement of the bound of $\displaystyle
\tilde{O}\left(\frac{1}{\epsilon^d}\right)$ that was obtained in 1993 by
Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point
sets in dimension $d\geq 3$.</abstract><doi>10.48550/arxiv.2104.12654</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2104.12654 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2104_12654 |
source | arXiv.org |
subjects | Computer Science - Computational Geometry Mathematics - Combinatorics |
title | Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T11%3A36%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Stronger%20Bounds%20for%20Weak%20Epsilon-Nets%20in%20Higher%20Dimensions&rft.au=Rubin,%20Natan&rft.date=2021-04-26&rft_id=info:doi/10.48550/arxiv.2104.12654&rft_dat=%3Carxiv_GOX%3E2104_12654%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |