Let B be any set of n axis-aligned boxes in Rd, d ≥ 1. For any point p, we define the subset Bp of B as Bp = {B ∈ B: p ∈ B}. A box B in Bp is said to be stabbed by p. A subset N ⊆ B is a (1/c)-ne
We present efficient algorithms to find a maximum-density planar subset of n 2-pin nets in a channel...
AbstractAn axis-parallel b-dimensional box is a Cartesian product R1×R2×⋯×Rb where Ri (for 1⩽i⩽b) is...
We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the pl...
Let B be any set of n axis-aligned boxes in R d, d ≥ 1. We call a subset N ⊆ B a(1/c)-net for B if a...
We show the existence of weak ε-nets of size O (1/ε log log (1/ε)) for point sets and axis-parallel ...
AbstractWe present in this paper a simple yet efficient algorithm for stabbing a set S of n axis-par...
Let S be a set of n points in R^d, and let r be a parameter with 1 \leq r \leq n. A rectilinear part...
Extending earlier ideas of Sobol ’ [11], Niederreiter [6] introduced the following definition. A (T,...
Let P be a set of n points in R-d. A point x is said to be a centerpoint of P if x is contained in e...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
International audienceThe geometric hitting set problem is one of the basic geometric com-binatorial...
An axis-parallel b-dimensional box is a Cartesian product R1×-2×...×Rb where Ri is a closed interval...
Let A be a set of distinct points in ℝd. A 2-subset {a, b} of A is called separated if there exists ...
An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a close...
AbstractThe following analogue of Tverberg's partition theorem in R3 is proved (among others): Every...
We present efficient algorithms to find a maximum-density planar subset of n 2-pin nets in a channel...
AbstractAn axis-parallel b-dimensional box is a Cartesian product R1×R2×⋯×Rb where Ri (for 1⩽i⩽b) is...
We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the pl...
Let B be any set of n axis-aligned boxes in R d, d ≥ 1. We call a subset N ⊆ B a(1/c)-net for B if a...
We show the existence of weak ε-nets of size O (1/ε log log (1/ε)) for point sets and axis-parallel ...
AbstractWe present in this paper a simple yet efficient algorithm for stabbing a set S of n axis-par...
Let S be a set of n points in R^d, and let r be a parameter with 1 \leq r \leq n. A rectilinear part...
Extending earlier ideas of Sobol ’ [11], Niederreiter [6] introduced the following definition. A (T,...
Let P be a set of n points in R-d. A point x is said to be a centerpoint of P if x is contained in e...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
International audienceThe geometric hitting set problem is one of the basic geometric com-binatorial...
An axis-parallel b-dimensional box is a Cartesian product R1×-2×...×Rb where Ri is a closed interval...
Let A be a set of distinct points in ℝd. A 2-subset {a, b} of A is called separated if there exists ...
An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a close...
AbstractThe following analogue of Tverberg's partition theorem in R3 is proved (among others): Every...
We present efficient algorithms to find a maximum-density planar subset of n 2-pin nets in a channel...
AbstractAn axis-parallel b-dimensional box is a Cartesian product R1×R2×⋯×Rb where Ri (for 1⩽i⩽b) is...
We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the pl...