Given a spatial region, this function finds an efficient covering of the region using discs of a chosen radius.
A window (object of class
positive number: the radius of the covering discs.
extra arguments passed to
Maximum number of attempts to place additional discs.
This function finds an efficient covering of the
W using discs of the given radius
The result is a point pattern giving the centres of the discs.
The algorithm tries to use as few discs as possible,
but is not guaranteed to find the minimal number of discs.
It begins by placing a hexagonal grid of points inside
then adds further points until every location inside
no more than
r units away from one of the points.
A point pattern (object of class
giving the centres of the discs.
1 2 3 4 5 6
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.