On the Size of the 3D Visibility Skeleton: Experimental Results (2009)
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k convex polytopes with...
ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE POUR L’OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR (2008)
Présentée Le Août, À La, Faculté Des, Sciences De Base, Christophe Weibel, Prof G. Ziegler
ingénieur mathématicien diplômé EPF de nationalités suisse et suédoise, et originaire de Schüpfen (BE) acceptée sur proposition du jury: Prof. T. Mountford, président du jury Prof. T....
Abstract On the Exact Maximum Complexity of Minkowski Sums of Convex (2008)
Efi Fogel, Dan Halperin, Christophe Weibel
We present a tight bound on the exact maximum complexity of Minkowski sums of convex polyhedra in R3. In particular, we prove that the maximum number of facets of the Minkowski sum of two convex...
On the Size of the 3D Visibility Skeleton: Experimental Results (2008)
Zhang, Linqiao, Everett, Hazel, Lazard, Sylvain, Weibel, Christophe, Whitesides, Sue
The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for $k$ convex polytopes with $n$...
On the Size of the 3D Visibility Skeleton: Experimental Results (2008)
Zhang, Linqiao, Everett, Hazel, Lazard, Sylvain, Weibel, Christophe, Whitesides, Sue
The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for $k$ convex polytopes with $n$...
A linear equation for Minkowski sums of polytopes relatively in general position (2007)
Fukuda, Komei, Weibel, Christophe
The objective of this paper is to study a special family of Minkowski sums, that is of polytopes relatively in general position. We show that the maximum number of faces in the sum can be attained by...
Minkowski sums of polytopes: combinatorics and computation (2007)
Minkowski sums are a very simple geometrical operation, with applications in many different fields. In particular, Minkowski sums of polytopes have shown to be of interest to both industry and the...
Minkowski sums of polytopes: combinatorics and computation (2007)
Minkowski sums are a very simple geometrical operation, with applications in many different fields. In particular, Minkowski sums of polytopes have shown to be of interest to both industry and the...
On the exact maximum complexity of Minkowski sums of convex polyhedra (2007)
Efi Fogel, Dan Halperin, Christophe Weibel
We present a tight bound on the exact maximum complexity of Minkowski sums of convex polyhedra in R3. In particular, we prove that the maximum number of facets of the Minkowski sum of two convex...
On the exact maximum complexity of Minkowski sums of convex polyhedra (2007)
Efi Fogel, Dan Halperin, Christophe Weibel
We present a tight bound on the exact maximum complexity of Minkowski sums of convex polyhedra in R 3. In particular, we prove that the maximum number of facets of the Minkowski sum of two convex...
Patient flow simulation as a tool for estimating policy impact (2006)
Osorio, Carolina, Weibel, Christophe, Perez, Pao, Bierlaire, Michel, Garnerin, Philippe
A conjecture about Minkowski additions of convex polytopes (2006)
Fukuda, Komei, Weibel, Christophe
This is a short paper on different proofs for special cases of a conjecture about Minkowski sums of polytopes.
On f-vectors of Minkowski additions of convex polytopes (2005)
Fukuda, Komei, Weibel, Christophe
The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial...
Computing faces up to k dimensions of a Minkowski sum of polytopes. (2005)
Weibel, Christophe, Fukuda, Komei
We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R^d. An algorithm for listing all faces of dimension up to j is presented, for any given 0