Dual Rectangles
نویسنده
چکیده
This article concerns a notion of duality between rectangles. A proof is given that only finitely many integral sided pairs of dual rectangles exist. Then a geometrical group law is shown to hold on the set of all rational self-dual rectangles. Finally, the arithmetic of a cubic surface is used to construct new pairs of rational dual rectangles from old, a technique inspired by the theory of elliptic curves.
منابع مشابه
Enumeration of Tilings of Quartered Aztec Rectangles
We generalize a theorem of W. Jockusch and J. Propp on quartered Aztec diamonds by enumerating the tilings of quartered Aztec rectangles. We use subgraph replacement method to transform the dual graph of a quartered Aztec rectangle to the dual graph of a quartered lozenge hexagon, and then use Lindström-GesselViennot methodology to find the number of tilings of a quartered lozenge hexagon.
متن کاملArea - Universal and Constrained Rectangular
A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. These layouts are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it is desirable for one rectangular layout to represent several area assignm...
متن کاملOrientation-Constrained Rectangular Layouts
We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientationconstrained layout, if it exists, may be constructed in polynomial time, and all orientation-constrained layouts may be listed in polynomial time per layout.
متن کاملBornes inférieures et méthodes exactes pour le problème de bin packing en deux dimensions avec orientation fixe
Our problem consists in determining the number of large identical rectanglesused to pack a list of rectangles with a fixed orientation. We propose methodsto compute lower bounds, based on the concept of dual-feasible functions. Wealso propose two enumerative exact methods. One is devoted to the problem withone bin. It uses a new relaxation of the problem. The other solves th...
متن کاملQuadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices
We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate-Cut – a technique we introduced in [12] that works by cutting rectangles.
متن کامل