
Geometry : 
Subject: Re: [geometry] Algorithm used in boost::geometry::buffer
From: Barend Gehrels (barend_at_[hidden])
Date: 20180823 17:15:37
Hi Santanu, thanks, will answer this next week
Regards, Barend
Sent from iPhone
> Op 23 aug. 2018 om 06:08 heeft Santanu Bhowmick via Geometry <geometry_at_[hidden]> het volgende geschreven:
>
> Hi,
>
> I'm trying to understand the algorithm underlying the buffer API in Boost.Geometry. The toplevel headers don't seem to have any citations (apologies if I've missed it still).
>
> I've the following queries:
> 1) What is the worstcase complexity of the buffer algorithm for a poly line / polygon? I would imagine it depends on the convex/reflex vertices in the input, so feel free to state the complexity in those terms.
>
> 2) What is the overall strategy used for getting the offset curve? Is it a variant of the pairwise offset strategy mentioned in "A pairwise offset algorithm for 2D pointsequence curve B.K. Choi*, S.C. Park (CAD 99), or something else ? I would really appreciate some pointers in this regard?
>
> Thanks!
>
> 
> Santanu Bhowmick
>
> _______________________________________________
> Geometry mailing list
> Geometry_at_[hidden]
> https://lists.boost.org/mailman/listinfo.cgi/geometry
Geometry list run by mateusz at loskot.net