Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference7 articles.
1. Covering the Plane with Convex Sets
2. On minimum circumscribed polygons
3. Finite coverings by translates of centrally symmetric convex domains
4. Densest packings of typical convex sets are not lattice-like
5. G. Fejes Tóth and T. Zamfirescu: For most convex discs thinnest
covering is not lattice-like. In: Intuitive Geometry, K. Böröczky and
G. Fejes Tóth (eds), János Bolyai series, North-Holland, Amsterdam, 1994.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献