Some numerical problems in discrete geometry

DOI10.1016/S0898-1221(99)00272-2MaRDI QIDQ1972477zbMATH OpenFDO

Authors Mihály Hujter

Publication date 18 October 2000

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(99)00272-2

zbMATH Keywords

discrete geometrylower boundspacking of disks

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• The smallest convex k-gon containing n congruent disks
• Some new structures for the ``equal circles packing in a square problem
• A new bound for the minimal diameter of nine coplanar congruent disks
• Covering a planar domain with sets of small diameter

Cites work

• A better packing of ten equal circles in a square
• Densest packings of equal circles in a square
• scientific article; zbMATH DE number 432979 (Why is no real title available?)
• scientific article; zbMATH DE number 3485818 (Why is no real title available?)
• On the Packing of Ten Equal Circles in a Square
• Optimal packings of eleven equal circles in an equilateral triangle
• Some progress in the packing of equal circles in a square
• The Packing of Equal Circles in a Square

Cited in

(4)

• Research Problems in Discrete Geometry
• scientific article; zbMATH DE number 5005328 (Why is no real title available?)
• Exhausting an Area with Discs
• Geometric Computations on Indecisive Points

This page was built for publication: Some numerical problems in discrete geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972477)