scientific article; zbMATH DE number 1284036
From MaRDI portal
Publication:4240381
We investigate the problem of finding an optimal segmentation of a given rectangle into subrectangles, thus continuing earlier work on this subject. In the present paper, we give a direct approach to optimal so-called crosscut segmentations, which are defined by vertical and horizontal crosscut lines through the rectangle. Finally, we prove comparison results for piecewise linear approximation on a rectangle. For the entire collection see [Zbl 0910.00047].
Recommendations
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 Q4240381)