ADCM
1999
13 years 4 months ago
1999
: Given f and rf at the vertices of a rectangular mesh, we build an interpolating function f by a subdivision algorithm. The construction on each elementary rectangle is independen...
CPC
2000
13 years 4 months ago
2000
Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
INTEGRATION
2007
13 years 4 months ago
2007
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
TALG
2008
13 years 4 months ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
COMPGEOM
2005
ACM
13 years 6 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...