A new combinatorial approach to optimal embeddings of rectangles
From MaRDI portal
Recommendations
- On embedding rectangular grids in hypercubes
- Embedding of Grids into Optimal Hypercubes
- The \(n\)-linear embedding theorem for dyadic rectangles
- An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles
- A New Approximation Algorithm for Multidimensional Rectangle Tiling
- The Rectangle Enclosure and Point-Dominance Problems Revisited
- Embedding into the rectilinear plane in optimal \(O(n^{2})\) time
- Optimal two-sided embeddings of complete binary trees in rectangular grids
- scientific article; zbMATH DE number 3942360
Cites work
- Bounds on the costs of data encodings
- Efficient Embeddings of Trees in Hypercubes
- Embedding of Grids into Optimal Hypercubes
- Encoding Data Structures in Trees
- On Embedding Rectangular Grids in Square Grids
- On embedding rectangular grids in hypercubes
- Preserving average proximity in arrays
- Space and Time Hierarchies for Classes of Control Structures and Data Structures
Cited in
(9)- Embedding grids into grids: Techniques for large compression ratios
- On embedding rectangular meshes into rectangular meshes of smaller aspect ratio
- Some new optimum Golomb rectangles
- On embedding rectangular grids in hypercubes
- Embedding grids into hypercubes
- Optimal embedding of 2-D torus into ring
- Many to One Embeddings from Grids into Cylinders, Tori, and Hypercubes
- Efficient embeddings of grids into grids
- scientific article; zbMATH DE number 4064518 (Why is no real title available?)
This page was built for publication: A new combinatorial approach to optimal embeddings of rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920427)
