Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms

DOI10.1137/S0895480101384347zbMath1050.68145OpenAlexW1983858495MaRDI QIDQ2784515

No author found.

Publication date: 23 April 2002

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480101384347

zbMATH Keywords

tilingapproximation algorithmsexact boundsbinary space partitions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45) Approximation algorithms (68W25)

Related Items (4)

Approximating points by a piecewise linear function ⋮ On communication protocols that compute almost privately ⋮ Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees ⋮ RELATIONS BETWEEN TWO COMMON TYPES OF RECTANGULAR TILINGS

This page was built for publication: Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms