
Geometry : 
Subject: [geometry] Algorithm used in boost::geometry::buffer
From: Santanu Bhowmick (santanu.bhowmick_at_[hidden])
Date: 20180823 04:08:15
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 list run by mateusz at loskot.net