Good and Bad Radii of Convex Polygons
From MaRDI portal
Publication:3352049
DOI10.1137/0220024zbMath0728.52002OpenAlexW1994650318MaRDI QIDQ3352049
Peter Gritzmann, Victor Klee, Laurent Habsieger
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220024
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Irrationality; linear independence over a field (11J72)
Related Items
Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces, On the complexity of some basic problems in computational convexity. I. Containment problems, Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces, Fixed-parameter complexity and approximability of norm maximization
