The Minimum Perimeter Convex Hull of a Given Set of Disjoint Segments
In this paper, we present an algorithm to compute the minimum perimeter convex hull of a given set of disjoint segments, so that each segment is contained in the hull completely or intersects with the boundary of the hull. The problem discussed in this paper is a novel transformation of TSP and MPSP. To solve this problem, we use a contraction strategy to contract the convex hull from a larger one which contains all endpoints of given segments to the direction of a smaller one which only contains some necessary points. We also assess the spatial relationships between outside segments and its convex hull, and add necessary segments into the convex hull successively by finding the shortest path of a sequence of segments. As a result, we present an O(n 5) algorithm for computing the minimum perimeter convex hull of a given set of disjoint segments.
KeywordsComputational geometry Algorithm Minimum perimeter convex hull Contraction strategy
This work is supported by the General Project of Liaoning Province Natural Science Foundation (No. 20170540147) and Liaoning Province Science and Research (No. L2015105).
- 5.Hassanzadeh, F., Rappaport, D.: Approximation algorithms for finding a minimum perimeter polygon intersecting a set of line segments. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009, vol. 5664. LNCS, pp. 363–374. Springer, Heidelberg (2009)Google Scholar
- 9.Wang, L., Jiang, B., Wei, Q., He, D.: Research on the Algorithm for euclidean shortest paths of visiting line segments in the plane. ICIC Expr. Lett. 8(6), 1683–1688 (2014)Google Scholar