Computing Minimum Bundling Distance of a Set of Line Segments

This paper introduces the concept of minimum bundling distance (MBD) of a set of line segments. We prove it can be calculated by computing the minimum distance between two convex polygon chains made of a set of line segments in a plane. We first propose an incremental method to compute the two convex polygon chains, and then give an improved algorithm of calculating minimum distance between them. The time complexity of the whole algorithm is O(nlogn).