A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING

DOI10.1142/S0218195910003335zbMath1201.52014OpenAlexW2126873594MaRDI QIDQ3575389

Benjamin Lafreniere, Anna Lubiw, Ferran Hurtado, Peter Brass

Publication date: 27 July 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195910003335

zbMATH Keywords

lower boundswireless networksdisk packing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Related Items (1)

Minimum ply covering of points with disks and squares

Cites Work

• On a circle placement problem
• On a class of \(O(n^ 2)\) problems in computational geometry
• A PTAS for a disc covering problem using width-bounded separators

This page was built for publication: A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING