Results 1  10
of
353
Hierarchical representations of collections of small rectangles
 ACM Computing Surveys
, 1988
"... A tutorial survey is presented of hierarchical data structures for representing collections of small rectangles. Rectangles are often used as an approximation of shapes for which they serve as the minimum rectilinear enclosing object. They arise in applications in cartography as well as very larges ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
A tutorial survey is presented of hierarchical data structures for representing collections of small rectangles. Rectangles are often used as an approximation of shapes for which they serve as the minimum rectilinear enclosing object. They arise in applications in cartography as well as very large
Fast subsequence matching in timeseries databases
 PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1994
"... We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract

Cited by 533 (24 self)
 Add to MetaCart
We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature
The distribution of points on curves over finite fields in some small rectangles, accepted by Monatsh
"... ar ..."
Heuristics for the Rectangle Packing Problem
, 1995
"... In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4heuristic for the pallet loading p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4heuristic for the pallet loading
Partitioning a rectangle into small perimeter rectangles
 DISCRETE APPLIED MATHEMATICS
, 1992
"... ..."
Spherical Wavelets: Efficiently Representing Functions on the Sphere
, 1995
"... Wavelets have proven to be powerful bases for use in numerical analysis and signal processing. Their power lies in the fact that they only require a small number of coefficients to represent general functions and large data sets accurately. This allows compression and efficient computations. Classic ..."
Abstract

Cited by 286 (14 self)
 Add to MetaCart
Wavelets have proven to be powerful bases for use in numerical analysis and signal processing. Their power lies in the fact that they only require a small number of coefficients to represent general functions and large data sets accurately. This allows compression and efficient computations
Equivalence and Dominance for Problems of Optimal Packing of Rectangles
, 1995
"... In this paper we consider the problem of optimal packing of small rectangles within a larger rectangle. The topic consists of a comprehensive investigation of equivalence and dominance of packing patterns. Using suitable kinds of equivalence and dominance, the goal is to develop an efficient branch& ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
In this paper we consider the problem of optimal packing of small rectangles within a larger rectangle. The topic consists of a comprehensive investigation of equivalence and dominance of packing patterns. Using suitable kinds of equivalence and dominance, the goal is to develop an efficient branch
4Block Heuristic for the Rectangle Packing Problem
 European Journal of Operational Research
, 1996
"... In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4heuristic for the pallet loading p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4heuristic for the pallet loading
RANDOM INFINITE SQUARINGS OF RECTANGLES
"... Abstract. A recent preprint [1] introduced a growth procedure for planar maps, whose almost sure limit is “the uniform infinite 3connected planar map”. A classical construction of Brooks, Smith, Stone and Tutte [7] associates a squaring of a rectangle (i.e. a tiling of a rectangle by squares) to a ..."
Abstract
 Add to MetaCart
rectangle. This provides a canonical planar embedding of the uniform infinite 3connected planar map. We also show that the limiting random squaring almost surely has a unique point of accumulation. (a) A random squaring of a rectangle with 6345 squares. (b) A magnification of a small region within the same
Covering a square by small perimeter rectangles
 DISCRETE COMPUTATIONAL GEOMETRY
, 1986
"... We show that if the unit square is covered by n rectangles, then at least one must have perimeter at least 4(2m + 1)/(n + m(m + 1)), where m is the largest integer whose square is at most n. This result is exact for n of the form m(m + 1) (or m²). ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We show that if the unit square is covered by n rectangles, then at least one must have perimeter at least 4(2m + 1)/(n + m(m + 1)), where m is the largest integer whose square is at most n. This result is exact for n of the form m(m + 1) (or m²).
Results 1  10
of
353