Add to ORKGIn this paper we present two different results dealing with the number of ( ≤ k)-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound 3 k+2 2 of ( ≤ k)-edges for a fixed 0 ≤ k ≤ bn/3c − 1; 2. We show that for k < bn/(d+1)c the number of ( ≤ k)-facets of a set of n points in general position in Rd is at least (d+1) k+d d, and that this bound is tight in the given range of k.
AbstractWe prove two new upper bounds on the number of facets that a d -dimensional 0/1-polytope can...
We obtain improved bounds on the complexity of m distinct faces in an arrangement of n pseudo-segmen...
jockusch(a3 mat h.lsa.umich.edu Abstract. We construct a family of cubical polytypes which shows tha...
AbstractIn this paper we present two different results dealing with the number of (≤k)-facets of a s...
In this paper we present three different results dealing with the number of ( ≤ k)-facets of a set o...
In this paper we present three different results dealing with the number of (< k)-facets of a set...
In this paper we present three different results dealing with the number of (≤ k)- facets of a set o...
We examine the number of triangulations that any set of n points in the plane must have, and prove t...
AbstractRecently, Aichholzer, García, Orden, and Ramos derived a remarkably improved lower bound for...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
Let S be a set of n points in the plane in general position, that is, no three points of S are on a ...
AbstractWe show that the number of straight-edge triangulations exhibited by any set of n points in ...
A k-set of a nite set S of points in the plane is a subset of car-dinality k that can be separated f...
We show that the number of straight-edge triangulations exhibited by any set of n points in general...
We use circular sequences to give an improved lower bound on the minimum number of (<=k)-sets in a s...
AbstractWe prove two new upper bounds on the number of facets that a d -dimensional 0/1-polytope can...
We obtain improved bounds on the complexity of m distinct faces in an arrangement of n pseudo-segmen...
jockusch(a3 mat h.lsa.umich.edu Abstract. We construct a family of cubical polytypes which shows tha...
AbstractIn this paper we present two different results dealing with the number of (≤k)-facets of a s...
In this paper we present three different results dealing with the number of ( ≤ k)-facets of a set o...
In this paper we present three different results dealing with the number of (< k)-facets of a set...
In this paper we present three different results dealing with the number of (≤ k)- facets of a set o...
We examine the number of triangulations that any set of n points in the plane must have, and prove t...
AbstractRecently, Aichholzer, García, Orden, and Ramos derived a remarkably improved lower bound for...
AbstractFor a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked ...
Let S be a set of n points in the plane in general position, that is, no three points of S are on a ...
AbstractWe show that the number of straight-edge triangulations exhibited by any set of n points in ...
A k-set of a nite set S of points in the plane is a subset of car-dinality k that can be separated f...
We show that the number of straight-edge triangulations exhibited by any set of n points in general...
We use circular sequences to give an improved lower bound on the minimum number of (<=k)-sets in a s...
AbstractWe prove two new upper bounds on the number of facets that a d -dimensional 0/1-polytope can...
We obtain improved bounds on the complexity of m distinct faces in an arrangement of n pseudo-segmen...
jockusch(a3 mat h.lsa.umich.edu Abstract. We construct a family of cubical polytypes which shows tha...