Advertisement

The Minimum Perimeter Convex Hull of a Given Set of Disjoint Segments

  • Yiyang Jia
  • Bo JiangEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 691)

Abstract

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.

Keywords

Computational geometry Algorithm Minimum perimeter convex hull Contraction strategy 

Notes

Acknowledgements

This work is supported by the General Project of Liaoning Province Natural Science Foundation (No. 20170540147) and Liaoning Province Science and Research (No. L2015105).

References

  1. 1.
    Lӧffler, M., van Kreveld, M.: Largest and smallest convex hulls for imprecise points. Algorithmica 56, 35 (2008)MathSciNetGoogle Scholar
  2. 2.
    Rappaport, D.: Minimum polygon transversals of line segments. Int. J. Comput. Geom. Appl. 5(3), 243–256 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Goodrich, M.T., Snoeyink, J.: Stabbing parallel segments with a convex polygon. Comput. Vis. Graph. Image Process. 49(2), 152–170 (1990)CrossRefzbMATHGoogle Scholar
  4. 4.
    Dumitrescu, A., Jiang, M.: Minimum-perimeter intersecting polygons. Algorithmica 63(3), 602–615 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 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
  6. 6.
    Díaz-Báñez, J.M., Korman, M., Pérez-Lantero, P., Pilz, A., Seara, C., Silveira, R.I.: New results on stabbing segments with a polygon. Comput. Geom. 48(1), 14–29 (2015)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)zbMATHGoogle Scholar
  8. 8.
    Cheng, Q., Chrobak, M., Sundaram, G.: Computing simple paths among obstacles. Comput. Geom. 16, 223–233 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 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
  10. 10.
    Graham, R.L.: An efficient algorithm for determining the convex hull of a finite planar set. Inf. Process. Lett. 1(4), 132–133 (1972)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Dalian Maritime UniversityDalianChina

Personalised recommendations