Some new bounds for Epsilon-nets

Algorithms in Combinatorial Geometry.

1989 • 1,871 citations

Learnability and the Vapnik-Chervonenkis dimension

1989 • 1,855 citations

Algorithms in Combinatorial Geometry

1987 • 1,507 citations

Applications of random sampling in computational geometry, II

1988 • 975 citations

ɛ-nets and simplex range queries

1987 • 754 citations

Combinatorial complexity bounds for arrangements of curves and spheres

1990 • 333 citations

New applications of random sampling in computational geometry

1987 • 324 citations

Quasi-optimal range searching in spaces of finite VC-dimension

1989 • 179 citations

Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension

1986 • 168 citations

How to net a lot with little: small ε-nets for disks and halfspaces

1990 • 112 citations

Combinatorial complexity bounds for arrangements of curves and surfaces

1988 • 99 citations

Construction of ɛ-nets

1990 • 82 citations

Covering the plane with convex polygons

1986 • 66 citations

A deterministic view of random sampling and its use in geometry

1988 • 32 citations

A deterministic algorithm for partitioning arrangements of lines and its application

1989 • 30 citations

Construction of epsilon nets

1989 • 22 citations