Publication:4222032
From MaRDI portal
zbMath0939.52008MaRDI QIDQ4222032
Publication date: 6 December 1998
51M20: Polyhedra and polytopes; regular figures, division of spaces
05B45: Combinatorial aspects of tessellation and tiling problems
52B45: Dissections and valuations (Hilbert's third problem, etc.)
52C20: Tilings in (2) dimensions (aspects of discrete geometry)
51M16: Inequalities and extremum problems in real or complex geometry
52-02: Research exposition (monographs, survey articles) pertaining to convex and discrete geometry
Related Items
Pizza again? On the division of polygons into sections with a common origin, On Reversibility among Parallelohedra, Meshes Preserving Minimum Feature Size, Unnamed Item, Hinged dissections exist, Geometric dissections now swing and twist., Lattice dissections: plainer and less fancy, Hole dissections for planar figures, Darwin's algorithms, Hugo Hadwiger's influence on geometric dissections with special properties, An approximation algorithm for dissecting a rectangle into rectangles with specified areas, The heptagon to the square, and other wild twists, Generalizations of Schöbi's tetrahedral dissection, Symmetry of opposites: Antisymmetry, The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square, Tiling a circular disc with congruent pieces, Twenty years of progress of \(\mathrm{JCDCG}^3\), Polyhedral characterization of reversible hinged dissections, A criterion for a pair of convex polygons to be reversible, Fun with fonts: algorithmic typography, Unexpected twists in geometric dissections, Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday), Generalization of Haberdasher's puzzle, Hinged dissection of polyominoes and polyforms, Irregular tilings of regular polygons with similar triangles, (1 + n) sequential dissection of a rectangle into m-GONS, m ∈{3,5,6,7,8}, Dissection with the Fewest Pieces is Hard, Even to Approximate
