On May 28, 8:27 am, Miroslav Balaz wrote:
> and that polygons are convex?
No, the polygon need not be convex,
though my algorithm is based upon an algorithm
that only works for convex polygons.
In fact the polygon need not be simple though
what you mean by area and chord for
non simple polygon
Of course , and i didnt find it there.
2009/5/31 Ajinkya Kale
> did you try the wiki :
> http://en.wikipedia.org/wiki/Semaphore_(programming) ?
>
> On Sun, May 31, 2009 at 4:57 PM, Miroslav Balaz
> wrote:
>
>> Does anybody know how to simulate semaphore by binary semaphore?I think
>> it is easy
did you try the wiki : http://en.wikipedia.org/wiki/Semaphore_(programming)?
On Sun, May 31, 2009 at 4:57 PM, Miroslav Balaz wrote:
> Does anybody know how to simulate semaphore by binary semaphore?I think it
> is easy, but i cant find it on internet. thanks
>
> >
>
--
Ciao,
Ajinkya
--~--~---
Does anybody know how to simulate semaphore by binary semaphore?I think it
is easy, but i cant find it on internet. thanks
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group
