Add to ORKGInternational audienceConsider the dilation and erosion of a shape S by a ball of radius ε. We call ε-covering of S any collection of balls whose union lies between the dilation and erosion of S. We prove that finding an ε-covering of minimum cardinality is NP-complete, using a reduction from vertex cover
Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. W...
Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. W...
Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. sam...
Let F be a covering of a unit ball U in Rd by unit balls. We prove that for any epsilon >0, the smal...
International audienceUnions of balls are widely used shape representations. Given a shape, computin...
International audienceGiven a set S in Rn, a (δ,ε)-ball approximation of S is defined as a collectio...
International audienceGiven a set S in Rn, a (δ,ε)-ball approximation of S is defined as a collectio...
à paraîtreInternational audienceA collection C of balls in R^d is \delta-inflatable if it is isometr...
Describing a complex geometric shape with a set of simple primitives is often a fundamental task for...
Describing a complex geometric shape with a set of simple primitives is often a fundamental task for...
Describing a complex geometric shape with a set of simple primitives is often a fundamental task for...
International audienceLet F \cup {U} be a collection of convex sets in R^d such that F covers U. We ...
International audienceShowing the existence of small-sized epsilon-nets has been the subject of inve...
International audienceLet F ∪ {U } be a collection of convex sets in Rd such that F covers U . We pr...
Représenter un objet géométrique complexe par un ensemble de primitives simples est une tâche souven...
Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. W...
Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. W...
Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. sam...
Let F be a covering of a unit ball U in Rd by unit balls. We prove that for any epsilon >0, the smal...
International audienceUnions of balls are widely used shape representations. Given a shape, computin...
International audienceGiven a set S in Rn, a (δ,ε)-ball approximation of S is defined as a collectio...
International audienceGiven a set S in Rn, a (δ,ε)-ball approximation of S is defined as a collectio...
à paraîtreInternational audienceA collection C of balls in R^d is \delta-inflatable if it is isometr...
Describing a complex geometric shape with a set of simple primitives is often a fundamental task for...
Describing a complex geometric shape with a set of simple primitives is often a fundamental task for...
Describing a complex geometric shape with a set of simple primitives is often a fundamental task for...
International audienceLet F \cup {U} be a collection of convex sets in R^d such that F covers U. We ...
International audienceShowing the existence of small-sized epsilon-nets has been the subject of inve...
International audienceLet F ∪ {U } be a collection of convex sets in Rd such that F covers U . We pr...
Représenter un objet géométrique complexe par un ensemble de primitives simples est une tâche souven...
Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. W...
Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. W...
Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. sam...