AbstractWe present a necessary and sufficient condition for the union of a finite number of convex polytopes in Rd to be convex. This generalises two theorems on convexity of the union of convex polytopes due to Bemporad et al
AbstractA set S in R is said to be χ-convex if and only if S does not contain a visually independent...
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real proj...
Rapport interne.A well-known result on unions of polyhedra in the same space gives an extended formu...
AbstractWe present a necessary and sufficient condition for the union of a finite number of convex p...
AbstractGiven a set of polyhedral cones C1,…,Ck⊂Rd, and a convex set D, does the union of these cone...
AbstractLet S be a finite set with m elements in a real linear space and let JS be a set of m interv...
AbstractIn this paper we consider the following basic problem in polyhedral computation: Given two p...
AbstractGiven a set of polyhedral cones C1,…,Ck⊂Rd, and a convex set D, does the union of these cone...
Let S be a finite set with m elements in a real linear space and let be a set of m intervals in . ...
AbstractIn this paper we consider the following basic problem in polyhedral computation: Given two p...
Abstract. We show by a construction that there are at least exp {cV (d−1)/(d+1) } convex lattice pol...
Article dans revue scientifique avec comité de lecture. nationale.National audienceA well-known resu...
Given a set of polyhedral cones C1, · · · , Ck ⊂ Rd, and a convex set D, does the union of these ...
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real proj...
In this paper we consider the following basic problem in polyhedral computation: Given two polyhedra...
AbstractA set S in R is said to be χ-convex if and only if S does not contain a visually independent...
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real proj...
Rapport interne.A well-known result on unions of polyhedra in the same space gives an extended formu...
AbstractWe present a necessary and sufficient condition for the union of a finite number of convex p...
AbstractGiven a set of polyhedral cones C1,…,Ck⊂Rd, and a convex set D, does the union of these cone...
AbstractLet S be a finite set with m elements in a real linear space and let JS be a set of m interv...
AbstractIn this paper we consider the following basic problem in polyhedral computation: Given two p...
AbstractGiven a set of polyhedral cones C1,…,Ck⊂Rd, and a convex set D, does the union of these cone...
Let S be a finite set with m elements in a real linear space and let be a set of m intervals in . ...
AbstractIn this paper we consider the following basic problem in polyhedral computation: Given two p...
Abstract. We show by a construction that there are at least exp {cV (d−1)/(d+1) } convex lattice pol...
Article dans revue scientifique avec comité de lecture. nationale.National audienceA well-known resu...
Given a set of polyhedral cones C1, · · · , Ck ⊂ Rd, and a convex set D, does the union of these ...
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real proj...
In this paper we consider the following basic problem in polyhedral computation: Given two polyhedra...
AbstractA set S in R is said to be χ-convex if and only if S does not contain a visually independent...
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real proj...
Rapport interne.A well-known result on unions of polyhedra in the same space gives an extended formu...
DOI
Add to ORKG