Subject: Re: [geometry] Buffer/Offsetting Polygon with holes
Date: 2014-05-21 09:39:25
>Unless you want to support a buffer with a negative distance....
You're right, but a slight modification of the algorithm gives you negative buffering. The Minkowski sum algorithm is first "thickening" every ring of the multipolygon by the size of the circle. It then computes the union of the thick rings with the original polygon to get the Minkowski sum result. That would emulate buffer with positive distance. Compute a difference with the original polygon instead of the union and the result emulates a buffer with a negative distance.
Note that I am not saying that this is the cleverest thing to do. It is my current workaround and again, this piece is not a bottleneck on my side and hence, the poor performance of that algorithm doesn't impact much on the overall performance.
Wireless Engineering and Propagation
tel. +33 384 544 338
Ce message et ses pieces jointes peuvent contenir des informations confidentielles ou privilegiees et ne doivent donc
pas etre diffuses, exploites ou copies sans autorisation. Si vous avez recu ce message par erreur, veuillez le signaler
a l'expediteur et le detruire ainsi que les pieces jointes. Les messages electroniques etant susceptibles d'alteration,
Orange decline toute responsabilite si ce message a ete altere, deforme ou falsifie. Merci.
This message and its attachments may contain confidential or privileged information that may be protected by law;
they should not be distributed, used or copied without authorisation.
If you have received this email in error, please notify the sender and delete this message and its attachments.
As emails may be altered, Orange is not liable for messages that have been modified, changed or falsified.
Geometry list run by mateusz at loskot.net