15 search results - page 1 / 3 » The number of guillotine partitions in d dimensions |
IPL
2006
13 years 4 months ago
2006
Guillotine partitions play an important role in many research areas and application domains, e.g., computational geometry, computer graphics, integrated circuit layout, and solid ...
SIU
2002
13 years 4 months ago
2002
Abstract. In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for...
DAM
1999
13 years 4 months ago
1999
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
TSP
2008
13 years 4 months ago
2008
Multidimensional hourglass filter banks decompose the frequency spectrum of input signals into hourglass-shaped directional subbands, each aligned with one of the frequency axes. T...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...