D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
An Expander-Based Approach to Geometric - Optimization Matthew Katz (Correct)
Deciding the VC Dimension is ...-complete, II - Schaefer (2000) (Correct)
Computing the Detour of Polygonal Curves - Agarwal, Klein, Knauer, Sharir (2002) (2 citations) (Correct)
Approximation Algorithms for Array Partitioning Problems - Muthukrishnan Torsten Suel (Correct)
Lenses in Arrangements of Pseudo-circles and Their.. - Agarwal, Nevo, Pach, .. (2002) (2 citations) (Correct)
Constructing Levels in Arrangements and Higher.. - Agarwal, de Berg, .. (1995) (24 citations) (Correct)
Trends and Developments in Computational Geometry - de Berg (1995) (Correct)
Geometric Approximation Algorithms and Randomized Algorithms for .. - Har-Peled (1999) (Correct)
Computing the Detour of Polygonal Curves - Agarwal, Klein, Knauer, Sharir (2002) (2 citations) (Correct)
Complexity of VC-classes of sequences with long repetitive - Runs Joel Ratsaby (Correct)
Computing the Detour of Polygonal Curves - Agarwal, Klein, Knauer, Sharir (2002) (2 citations) (Correct)
Covering with Ellipses - Efrat, Hoffmann, Knauer, Kriegel.. (2001) (Correct)
Discrete Mathematics and Theoretical Computer Science DMTCS.. - Bernard Ycart And (Correct)
Constructing Planar Cuttings in Theory and Practice - Har-Peled (Correct)
Geometric Range Searching - Matousek (1994) (40 citations) (Correct)
Lenses in Arrangements of Pseudo-circles and Their - Applications Pankaj Agarwal (Correct)
Bounded VC-dimension implies a fractional Helly theorem - Matousek (2003) (Correct)
Bounded VC-dimension implies a fractional Helly theorem - Matousek (2002) (Correct)
Approximation Algorithms for Array Partitioning Problems - Muthukrishnan Torsten Suel (Correct)
Transversal Numbers for Hypergraphs Arising in Geometry - Alon, Kalai, al. (2001) (5 citations) (Correct)
The Combinatorial and Topological Complexity of a Single Cell - Basu (2003) (1 citation) (Correct)
Covering with Ellipses - Efrat, Hoffmann, Knauer, Kriegel.. (2001) (Correct)
Noise-Tolerant Distribution-Free Learning of General.. - Bshouty, Goldman, al. (1996) (12 citations) (Correct)
Approximation Algorithms for Minimum-Width Annuli and.. - Agarwal, Aronov.. (Correct)
A General Lower Bound on the Number - Of Examples Needed Self-citation (Haussler) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC