Article

Free access

Improved bounds on weak ε-nets for convex sets

Authors:

Bernard Chazelle,

Herbert Edelsbrunner,

Michelangelo Grigni,

Leonidas Guibas,

Micha Sharir,

Emo WelzlAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 495 - 504

https://doi.org/10.1145/167088.167222

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

Alon, N., B~r#ny, I., Fiiredi, Z., Kleitman, D. Point selections and weak e-nets for convex hulls, Combin. Prob. and Computing 1, submitted.

Google Scholar

[2]

Alon, N., Kleitman, D. Piercing convex sets and the Hadwiger Debrunner (p, q)-problem, Adv. Math. (to appear).

Google Scholar

[3]

Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M. Wenger, R. Points and triangles in the plane and halving planes in space, Discrete Comput. Geom. 6 (1991), 435-442.

Digital Library

Google Scholar

[4]

Berger, M. Geometry 11, Springer-Verlag, 1987.

Google Scholar

[5]

Capoyleas, V. An almost linear upper bound for weak ~-nets of points in convex position, manuscript, 1992.

Google Scholar

[6]

Chazelle, B. Cutting hvperplanes for divide-andconquer, Disc. Comput. Geom. (1991), in press. Also, CS-TR-335-91, Princeton University, 1991. Prelim. version in Proc. 32nd FOCS, 1991.

Google Scholar

[7]

Chazelle, B., Edelsbrunner, H., Guibas, L.J., Hershberger, J., Seidel, R., Sharir, M. Slimming down by adding; selecting heavily covered points, Proc. 6th ACM Symp. on Computational Geometry (1990), 116-127.

Digital Library

Google Scholar

[8]

Chazelle, B, Matou#ek, J. On linear-time deterministic algorithms for optzmization problems in fixed dimension, 4th Annual ACM-SIAM Syrup. on Discrete Algorithms (1993), 281-290.

Digital Library

Google Scholar

[9]

Coxeter, H.M.S. Non-Euclidean Geometry, Univ. Toronto Press, Toronto, 1942.

Google Scholar

[10]

Edelsbrunner, H. Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg 1987.

Digital Library

Google Scholar

[11]

Epstein, D.B.A. Analytical and Geometric Aspects of Hyperbolic Space, London Math. Society Lecture Notes Series 111, 1984.

Google Scholar

[12]

Fenchel, W. Elementary Geometry in Hyperbolic Space, de Gruyter Studies in Mathematics 11, 1989.

Crossref

Google Scholar

[13]

Haussler, D., Welzl, E. Epsilon nets and simplex range queries, Discrete Comput. Geom. 2 (1987), 127-151.

Digital Library

Google Scholar

[14]

Magnus, W. Noneuclidean tesselations and their groups, Academic Press, New York and London, 1974.

Google Scholar

[15]

Matou#ek, J. Private communication, 1992.

Google Scholar

[16]

Matou#ek, J. Approximations and optimal geometric divide-and-conquer, Proc. 23rd Annu. ACM Symp. Theory Comput. (1991), 506-511.

Digital Library

Google Scholar

[17]

Milnor, J. Hyperbolic geometry: the first 150 years, Bull. Amer. Math. Soc. 6 (1982), 9-24.

Crossref

Google Scholar

[18]

Thurston, W.P. The Geometry and Topology of 3- manifolds, Princeton Univ. Math. Dept. 1979.

Google Scholar

Cited By

View all

Feldman D(2019)Core-Sets: Updated SurveySampling Techniques for Supervised or Unsupervised Tasks10.1007/978-3-030-29349-9_2(23-44)Online publication date: 27-Oct-2019
https://doi.org/10.1007/978-3-030-29349-9_2
Feldman D(2019)Core‐sets: An updated surveyWIREs Data Mining and Knowledge Discovery10.1002/widm.133510:1Online publication date: Oct-2019
https://doi.org/10.1002/widm.1335
Mustafa NRay S(2016)An optimal generalization of the Colorful Carathéodory theoremDiscrete Mathematics10.1016/j.disc.2015.11.019339:4(1300-1305)Online publication date: 6-Apr-2016
https://dl.acm.org/doi/10.1016/j.disc.2015.11.019
Show More Cited By

Index Terms

Improved bounds on weak ε-nets for convex sets
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Weak sharp minima revisited, Part III: error bounds for differentiable convex inclusions
Nonlinear convex optimization and variational inequalities

The notion of weak sharp minima unifies a number of important ideas in optimization. Part I of this work provides the foundation for the theory of weak sharp minima in the infinite-dimensional setting. Part II discusses applications of these results to ...
Lower bounds for weak epsilon-nets and stair-convexity
SCG '09: Proceedings of the twenty-fifth annual symposium on Computational geometry

A set N ⊂ R^d is called a weak ε-net (with respect to convex sets) for a finite X ⊂ R^d if N intersects every convex set C with |X ∩ C|≥ε|X|. For every fixed d≥ 2 and every r≥ 1 we construct sets X⊂ R^d for which every weak 1/r-net has at least Ω(r log^d-1 ...
Stronger bounds for weak epsilon-nets in higher dimensions
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

Given a finite point set P in ℝ^d, and >0 we say that N⊆ ℝ^d is a weak -net if it pierces every convex set K with |K∩ P|≥ є |P|.

Let d≥ 3. We show that for any finite point set in ℝ^d, and any є>0, there exist a weak -net of cardinality O(1/є^d−1/2+γ), ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
260
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Feldman D(2019)Core-Sets: Updated SurveySampling Techniques for Supervised or Unsupervised Tasks10.1007/978-3-030-29349-9_2(23-44)Online publication date: 27-Oct-2019
https://doi.org/10.1007/978-3-030-29349-9_2
Feldman D(2019)Core‐sets: An updated surveyWIREs Data Mining and Knowledge Discovery10.1002/widm.133510:1Online publication date: Oct-2019
https://doi.org/10.1002/widm.1335
Mustafa NRay S(2016)An optimal generalization of the Colorful Carathéodory theoremDiscrete Mathematics10.1016/j.disc.2015.11.019339:4(1300-1305)Online publication date: 6-Apr-2016
https://dl.acm.org/doi/10.1016/j.disc.2015.11.019
Mustafa NRay SDey TWhitesides S(2012)A theorem of bárány revisited and extendedProceedings of the twenty-eighth annual symposium on Computational geometry10.1145/2261250.2261300(333-338)Online publication date: 17-Jun-2012
https://dl.acm.org/doi/10.1145/2261250.2261300
Mustafa NRay S(2010)Reprint ofComputational Geometry: Theory and Applications10.1016/j.comgeo.2007.02.00743:6-7(565-571)Online publication date: 1-Aug-2010
https://dl.acm.org/doi/10.1016/j.comgeo.2007.02.007
Mustafa NRay S(2009)An optimal extension of the centerpoint theoremComputational Geometry: Theory and Applications10.1016/j.comgeo.2007.10.00442:6-7(505-510)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1016/j.comgeo.2007.10.004
Mustafa NRay S(2008)Weak ε-nets have basis of size O (1/εlog(1/ε)) in any dimensionComputational Geometry: Theory and Applications10.1016/j.comgeo.2007.02.00640:1(84-91)Online publication date: 1-May-2008
https://dl.acm.org/doi/10.1016/j.comgeo.2007.02.006
Ray SMustafa NErickson J(2007)Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimensionProceedings of the twenty-third annual symposium on Computational geometry10.1145/1247069.1247113(239-244)Online publication date: 6-Jun-2007
https://dl.acm.org/doi/10.1145/1247069.1247113
Ray SMustafa NErickson J(2007)An optimal generalization of the centerpoint theorem, and its extensionsProceedings of the twenty-third annual symposium on Computational geometry10.1145/1247069.1247097(138-141)Online publication date: 6-Jun-2007
https://dl.acm.org/doi/10.1145/1247069.1247097
Chazelle B(2005)Deterministic sampling and optimizationSystem Modelling and Optimization10.1007/BFb0035458(42-54)Online publication date: 23-Jun-2005
https://doi.org/10.1007/BFb0035458
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Weak sharp minima revisited, Part III: error bounds for differentiable convex inclusions

Lower bounds for weak epsilon-nets and stair-convexity

Stronger bounds for weak epsilon-nets in higher dimensions