Helly-type theorems for approximate covering (2009)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F ∪ {U } be a collection of convex sets in Rd such that F covers U . We prove that if the elements of F and U have comparable size then a small subset of F suffices to cover most of the volume...
Helly-type theorems for approximate covering (2009)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F ∪ {U } be a collection of convex sets in Rd such that F covers U . We prove that if the elements of F and U have comparable size then a small subset of F suffices to cover most of the volume...
On the Complexity of Umbra and Penumbra (2009)
Demouth, Julien, Devillers, Olivier, Everett, Hazel, Glisse, Marc, Lazard, Sylvain, Seidel, Raimund
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full light if it sees...
On the Complexity of Umbra and Penumbra (2009)
Demouth, Julien, Devillers, Olivier, Everett, Hazel, Glisse, Marc, Lazard, Sylvain, Seidel, Raimund
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full light if it sees...
Computing Direct Shadows Cast by Convex Polyhedra (2009)
Demouth, Julien, Goaoc, Xavier
We present an exact method to compute the boundaries between umbra, penumbra and full-light regions cast on a plane by a set of disjoint convex polyhedra, some of which are light sources. This method...
Computing Direct Shadows Cast by Convex Polyhedra (2009)
Demouth, Julien, Goaoc, Xavier
We present an exact method to compute the boundaries between umbra, penumbra and full-light regions cast on a plane by a set of disjoint convex polyhedra, some of which are light sources. This method...
Julien Demouth, Marc Glisse, Between Umbra
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full light if it sees...
Between umbra and penumbra (2008)
Julien Demouth, Olivier Devillers, Hazel Everett, Sylvain Lazard, Raimund Seidel
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full light if it sees...
Helly-type theorems for approximate covering (2008)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F \cup {U} be a collection of convex sets in R^d such that F covers U. We prove that if the elements of F and U have comparable size then a small subset of F suffices to cover most of the volume...
Helly-type theorems for approximate covering (2008)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F \cup {U} be a collection of convex sets in R^d such that F covers U. We prove that if the elements of F and U have comparable size then a small subset of F suffices to cover most of the volume...
Événements visuels de convexes et limites d'ombres (2008)
Pour le calcul d'ombres en informatique graphique, il est courant de s'intéresser à la vue qu'un observateur a d'une scène géométrique. En particulier, il est important de caractériser les...
Événements visuels de convexes et limites d'ombres (2008)
Pour le calcul d'ombres en informatique graphique, il est courant de s'intéresser à la vue qu'un observateur a d'une scène géométrique. En particulier, il est important de caractériser les...
Événements visuels de convexes et limites d'ombres (2008)
Pour le calcul d'ombres en informatique graphique, il est courant de s'intéresser à la vue qu'un observateur a d'une scène géométrique. En particulier, il est important de caractériser les...
Événements visuels de convexes et limites d'ombres (2008)
Pour le calcul d'ombres en informatique graphique, il est courant de s'intéresser à la vue qu'un observateur a d'une scène géométrique. En particulier, il est important de caractériser les...
Helly-type theorems for approximate covering (2007)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F be a covering of a unit ball U in Rd by unit balls. We prove that for any epsilon >0, the smallest subset of F leaving at most a volume epsilon of U uncovered has size...
Helly-type theorems for approximate covering (2007)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F be a covering of a unit ball U in Rd by unit balls. We prove that for any epsilon >0, the smallest subset of F leaving at most a volume epsilon of U uncovered has size...
Helly-type theorems for approximate covering (2007)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F be a covering of a unit ball U in Rd by unit balls. We prove that for any epsilon >0, the smallest subset of F leaving at most a volume epsilon of U uncovered has size...
Helly-type theorems for approximate covering (2007)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F be a covering of a unit ball U in Rd by unit balls. We prove that for any epsilon >0, the smallest subset of F leaving at most a volume epsilon of U uncovered has size...
Helly-type theorems for approximate covering (2007)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F be a covering of a unit ball U in Rd by unit balls. We prove that for any epsilon >0, the smallest subset of F leaving at most a volume epsilon of U uncovered has size...
Helly-type theorems for approximate covering (2007)
Demouth, Julien, Devillers, Olivier, Glisse, Marc, Goaoc, Xavier
Let F be a covering of a unit ball U in Rd by unit balls. We prove that for any epsilon >0, the smallest subset of F leaving at most a volume epsilon of U uncovered has size...
On the Complexity of Umbra and Penumbra (2007)
Demouth, Julien, Devillers, Olivier, Everett, Hazel, Glisse, Marc, Lazard, Sylvain, Seidel, Raimund
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full light if it sees...
On the Complexity of Umbra and Penumbra (2007)
Demouth, Julien, Devillers, Olivier, Everett, Hazel, Glisse, Marc, Lazard, Sylvain, Seidel, Raimund
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full light if it sees...
Between umbra and penumbra (2007)
Demouth, Julien, Devillers, Olivier, Everett, Hazel, Glisse, Marc, Lazard, Sylvain, Seidel, Raimund
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full light if it sees...
Between umbra and penumbra (2007)
Demouth, Julien, Devillers, Olivier, Everett, Hazel, Glisse, Marc, Lazard, Sylvain, Seidel, Raimund
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full light if it sees...