501 search results - page 1 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We consider the number of different ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments,...
JCT
2006
13 years 5 months ago
2006
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...
JCT
2011
13 years 8 days ago
2011
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define...
DAM
2006
13 years 5 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...