Buffer Curve and Buffer Generation Algorithm in Aid of Edge Constrained Triangle Network

With existing buffer generating algorithms assessed, this paper proposes a new algorithm in aid of edge constrained triangular network to create vector buffer. The algorithm consists of two steps. The first step is to construct buffer curve, a new concept proposed to be a mid stage to unify the algorithm for arbitrary buffer of all possible types of geometric objects and their combination. The second step is to extract the ultimate buffer from buffer curve. Edge constrained triangular network is applied to accelerate the detection of intersections and self intersects of buffer curve. Winding number is employed to distinguish those segments in buffer curve that comprise the ultimate buffer.