The number of guillotine partitions in d dimensions-Reference-Cited by-同舟云学术

The number of guillotine partitions in d dimensions

Published:2006-05 Issue:4 Volume:98 Page:162-167
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Ackerman Eyal,Barequet Gill,Pinter Ron Y.,Romik Dan

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference14 articles.

1. C. Ballieux, Motion planning using binary space partitions, Technical Report Inf/src/93-25, Utrecht University, The Netherlands, 1993

2. Near real-time shadow generation using BSP trees;Chin;Comput. Graph.,1989

3. D.Z. Du, L.Q. Pan, M.T. Shing, Minimum edge length guillotine rectangular partition, Technical Report MSRI 02418-86, Univ. of California, Berkeley, CA, 1986

4. On visible surface generation by a priori tree structures;Fuchs;Comput. Graph.,1980

5. On optimal guillotine partitions approximating optimal d-box partitions;Gonzalez;Comput. Geom.,1994

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing the coarseness of a bicolored point set on the plane over guillotine partitions;2023 42nd IEEE International Conference of the Chilean Computer Science Society (SCCC);2023-10-23

2. Keep your distance: Land division with separation;Computational Geometry;2023-08

3. Optimizing squares covering a set of points;Theoretical Computer Science;2018-06

4. Permutation of elements in double semigroups;Semigroup Forum;2015-04-04

5. Towards Characterizing Graphs with a Sliceable Rectangular Dual;Lecture Notes in Computer Science;2015