Posted by
Michael Schmid on
URL: http://imagej.273.s1.nabble.com/Johnson-Mehl-process-anyone-tp3693473p3693475.html
Hi Gabriel,
if the lines keep their width and don't stop, I guess that you would
simply have the 1D case of Johnson-Mehl-Avrami-Kolmogorov growth (aka
Avrami equation, Kolmogorov-Johnson-Mehl-Avrami, KJMA, JMAK, ...).
So, if you have enough nuclei, all starting at a random time, and
never stopping, I guess that you would simply get an Avrami exponent
of 2 (1 for linear growth of lines + 1 for the number of lines; the
latter including phantom lines, i.e., lines that are within other
lines).
The problem that I see: how to treat lines stopping at intersections
- no idea. But I am not really an expert on Avrami etc.
Best wishes,
Michael
________________________________________________________________
On 4 Mar 2009, at 17:57, Gabriel Landini wrote:
> I am interested in constructing a graph that partitions the plane
> (image)
> based on a number of short seed lines. These lines grow all at the
> same speed
> until they intersect with another line (and they stop) or reach the
> image
> border.
>
> I think that this is similar to a Johnson-Mehl process, but I have
> not seen
> this described in the literature as growing from lines.
> Has anybody seen anything like this? If so, does it have a name?
>
> Is there a better approach other than growing all the lines at the
> same time
> (or sequentially 1 small increment at a time) and checking for
> intersections?
>
> Many thanks
>
> Gabriel