1.  Erect a solid, impremeable wall around the perimeter.
2.  Put a very flexible, membrane around each circle.
3.  Add a drop of low viscosity, low surface tension liquid to each
    circle.
4.  At some point, all circles will have expanded to completely fill the
    space.
5.  The membranes will define your optimum solution.

Soap bubbles with micropipets to inflate them may work equally well.

Clint

Clint Bowman                    INTERNET:       cl...@ecy.wa.gov
Air Quality Modeler             INTERNET:       cl...@math.utah.edu
Department of Ecology           VOICE:          (360) 407-6815
PO Box 47600                    FAX:            (360) 407-7534
Olympia, WA 98504-7600

        USPS:           PO Box 47600, Olympia, WA 98504-7600
        Parcels:        300 Desmond Drive, Lacey, WA 98503-1274

On Thu, 31 May 2012, David Winsemius wrote:


On May 31, 2012, at 2:26 PM, R. Michael Weylandt wrote:

On Thu, May 31, 2012 at 11:23 AM, AMFTom <the.quiet.r...@gmail.com> wrote:
I have photographs of plots that look like so:

http://r.789695.n4.nabble.com/file/n4631960/Untitled.jpg

I need to divide it up so each circle has an equal area surrounding it. So
into 20 equal segments, each of which contains a circle. Quadratcount is not
sufficient because if I divide it up into 36 equal quadrats, some quadrats
do not contain one of the circles.

I must admit I found this a little confusing -- are you trying to
divide into twenty segments or 36? Also, what package does
quadratcount come from?

I'm guessing this might work better in an image processing/computer
vision program than in R.


The solution[1] requires a higher level of intelligence than is typical in ordinary clustering mechanisms. Maybe some sort of "symbolic geometry" program exists somewhere? There are really two levels of symmetry that need to be processed to come up with an approach that satisfies both constraints (equi-area-partition and all-area-included) . Agree it's not a statistical problem ... not was it offered in a manner that lent itself to testing an algorithmic solution.

--
David.

[1] Which is too large to fit into the margins of this posting.

Best,
Michael


I'm not even sure how to do it mathematically, let alone using R.

Can anyone help?

--
View this message in context: http://r.789695.n4.nabble.com/Quadrat-counting-with-spatstat-tp4631960.html
Sent from the R help mailing list archive at Nabble.com.

______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.

______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.

David Winsemius, MD
West Hartford, CT

______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.

______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.

Reply via email to