in reply to Re^2: polygon buffering algorithms
in thread polygon buffering algorithms

You're right...the algorithm that I outlined works for convex polygons. In order to deal with polygons with concavities, I believe that you need to allow for overlap and take the union of all points that lie in the interior. In the case of the polygon that you gave, it would then be a square. Just for my own edification, what is the $d that you're referring to?

thor

Feel the white light, the light within
Be your own disciple, fan the sparks of will
For all of us waiting, your kingdom will come

Replies are listed 'Best First'.
Re^4: polygon buffering algorithms
by ikegami (Patriarch) on Feb 08, 2005 at 19:53 UTC
    The OP refered to "buffer distance 'd'". That's what I meant by $d. (I added the $ without thinking.)
[reply]
[d/l]
[select]

In Section Seekers of Perl Wisdom