Prev: Can ODE solve this?
Next: Band pass filter problem
From: Shen on 14 Apr 2010 13:11
I'm working on some data that'll require a geometry code. Essentially, the data is composed of a number of randomly sized circles on a flat surface. I have to see how much overlap is there and the thickness of overlap:

1. Does anyone know a code (or suggestions on how to write a code) to find the total overlapping areas of a number of randomly sized circles?

2. Of equal importance, I also need to know how many overlap regions overlap once, twice, thrice,... nXs (where n is the total number of circles) and the corresponding areas of overlap once, twice, thrice, nXs.

Any help will be much appreciated!
From: David Young on 14 Apr 2010 13:54
In what form is the input? That is, how are the circles specified? For example, are you starting from some kind of image?
From: ImageAnalyst on 14 Apr 2010 14:46
Unless your circles are somewhat transparent, it could be difficult to
determine overlap. For example, if two circles are 95% overlapped,
they may not look different in shape than a single circle, so you'd
have to go by the intensity within the shape.
Post your image to http://drop.io so we can see it.
From: Shen on 14 Apr 2010 15:05
"David Young" <d.s.young.notthisbit(a)sussex.ac.uk> wrote in message <hq4vfs$nbd$1(a)fred.mathworks.com>...
> In what form is the input? That is, how are the circles specified? For example, are you starting from some kind of image?

It's not some kind of image. Rather, it's xy-coordinates and radiis of thousands of randomly sized and distributed circles on a flat plane. In other words, my inputs are three arrays:

x-coordinate array
y-coordinate array
radius array
 | 
Pages: 1
Prev: Can ODE solve this?
Next: Band pass filter problem