The number of guillotine partitions in d dimensions |
| |
Authors: | Eyal Ackerman Ron Y. Pinter |
| |
Affiliation: | a Department of Computer Science, Technion—Israel Institute of Technology, Haifa 32000, Israel b Department of Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel |
| |
Abstract: | Guillotine partitions play an important role in many research areas and application domains, e.g., computational geometry, computer graphics, integrated circuit layout, and solid modeling, to mention just a few. In this paper we present an exact summation formula for the number of structurally-different guillotine partitions in d dimensions by n hyperplanes, and then show that it is . |
| |
Keywords: | Combinatorial problems Guillotine partitions Binary space partitions |
本文献已被 ScienceDirect 等数据库收录! |
|