44 search results - page 1 / 9 » On the number of rectangulations of a planar point set |
104
click to vote
JCT
2006
15 years 1 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...
COCOON
2005
Springer
15 years 6 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,...
111
Voted
CORR
2002
Springer
15 years 26 days ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
108
click to vote
CCCG
2003
15 years 2 months ago
2003
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double...
104
Voted
CCCG
2007
15 years 2 months ago
2007
We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...