On isoperimetrically optimal polyforms

DOI10.1016/j.tcs.2008.06.043zbMath1160.68047OpenAlexW2030891972MaRDI QIDQ952470

Daniel Vainsencher, Alfred Marcel Bruckstein

Publication date: 12 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.043

zbMATH Keywords

isoperimetric inequalitydiscrete geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items

Planar lattice subsets with minimal vertex boundary ⋮ Minimum-perimeter lattice animals and the constant-isomer conjecture ⋮ Algorithms for counting minimum-perimeter lattice animals ⋮ Maximal fluctuations around the Wulff shape for edge-isoperimetric sets in \({\mathbb{Z}}^d \): a sharp scaling law ⋮ Isoperimetrically Optimal Polygons in the Triangular Grid ⋮ VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH ⋮ Metastability of hard-core dynamics on bipartite graphs ⋮ On isoperimetrically optimal polyforms ⋮ Digital Geometry in Image-Based Metrology ⋮ Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On isoperimetrically optimal polyforms
• On the quadratic mapping \(z\rightarrow z^{2}-\mu \) for complex \(\mu \) and \(z\): the fractal structure of its set, and scaling
• A local-global principle for vertex-isoperimetric problems
• Polyominoes with minimum site-perimeter and full set achievement games
• Two Discrete Forms of the Jordan Curve Theorem
• Discrete Isoperimetric Problems
• On Minimal Perimeter Polyminoes