scientific article; zbMATH DE number 431514
The author presents upper and lower bounds for the maximum number of subrectangles, called \(f(n)\), that a rectangle can be partitioned into so that any line that is parallel to a side of the rectangle intersects at most \(n\) subrectangles. Bounds are also presented for the problems where ``rectangle is replaced by ``rank-rectangle (in which subrectangles that stretch from a side to the opposite side are deleted), and where the lines can have arbitrary slope. Conjectures for improvements of these bounds, including the conjecture that \(f(n)= 3\cdot 2^{n-1}- 2\) (the current lower bound) for the original problem, as well as a list of open problems, are also provided. For the entire collection see [Zbl 0778.00037].
- Partitioning a rectangle into small perimeter rectangles
- scientific article; zbMATH DE number 3908449
- On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections
- On partitions of a rectangle into rectangles with restricted number of cross sections
- An upper bound on the number of rectangulations of a point set
- Partition problems in high dimensional boxes
- Brick partition problems in three dimensions
- On partitions of a rectangle into rectangles with restricted number of cross sections
- On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections
- An upper bound on the number of rectangulations of a point set
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138290)