Construction of ɛ-nets

1990/10/01 by Jiřı́ Matoušek, Jiří Matoušek · 2 citations
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Binary logarithm #Combinatorics #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #Discrete mathematics #Geometry #Mathematics #Plane (geometry) #Simplex #Wedge (geometry)

paper · pdf · doi:10.1007/bf02187804

crossref issued 1990/10/01 · crossref published 1990/10/01 · crossref published-online 1990/10/01 · crossref published-print 1990/10/01 · openalex publication_date 1990/10/01 · crossref created 2005/09/20 · crossref deposited 2020/04/09 · openalex created_date 2025/10/10 · crossref indexed 2026/03/03 · openalex updated_date 2026/07/29

Citations

• An Optimal-Time Algorithm for Slope Selection
• Constructing Belts in Two-Dimensional Arrangements with Applications
• Combinatorial complexity bounds for arrangements of curves and spheres
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• An 0(n log n) sorting network
• On the ratio of optimal integral and fractional covers
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Applications of random sampling in computational geometry, II

Cited by

• Partitioning arrangements of lines I: An efficient deterministic algorithm
• K-set (geometry) [wikipedia]