Good and Bad Radii of Convex Polygons
From MaRDI portal
Publication:3352049
DOI10.1137/0220024zbMath0728.52002MaRDI QIDQ3352049
Laurent Habsieger, Peter Gritzmann, Victor Klee
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
width; diameter; circumradius; inradius; convex lattice polygon; implicit computation; rationalizing polynomial
52B20: Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52A10: Convex sets in (2) dimensions (including convex curves)
11J72: Irrationality; linear independence over a field
Related Items
Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces, On the complexity of some basic problems in computational convexity. I. Containment problems, Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces