scientific article
From MaRDI portal
Publication:3514517
zbMath1154.52008MaRDI QIDQ3514517
Publication date: 21 July 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies (number-theoretic aspects) (11H06) Isoperimetric problems for polytopes (52B60) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items (9)
Tight bounds on discrete quantitative Helly numbers ⋮ Elementary geometry on the integer lattice ⋮ On the combinatorial complexity of approximating polytopes ⋮ Moving out the edges of a lattice polygon ⋮ Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ Testing convexity of figures under the uniform distribution ⋮ Digital convex + unimodular mapping = 8-connected (all points but one 4-connected) ⋮ Efficient Algorithms to Test Digital Convexity
This page was built for publication:
