Apr 8, 2008 · View a PDF of the paper titled A Lower Bound on the Area of a 3-Coloured Disk Packing, by Peter Brass and 3 other authors. View PDF. Abstract ...
Given a set of unit-discs in the plane with union area. A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs?
Missing: Disk | Show results with:Disk
Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks?
Given a set of unit-disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks?
Apr 8, 2008 · In this section we describe a wireless network deployment problem that motivates our 3-coloured disk packing problem, and discuss other disk ...
Given a set of unit-discs in the plane with union area. A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs?
This work conjecture that it is always possible to cover at least 1=1:41 of the union area and prove 1=2:77, and provides an O(n 2 ) algorithm to select a ...
Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks?
Abstract: Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs?
Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw: A Lower Bound on the Area of a 3-Coloured Disk Packing. CoRR abs/0804.1173 (2008).