Abstract
In this paper a measure of non-convexity for a simple polygonal region in the plane is introduced. It is proved that for “not far from convex” regions this measure does not decrease under the Minkowski sum operation, and guarantees that the Minkowski sum has no “holes”.
Article PDF
Similar content being viewed by others
References
Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. In: Lecture Notes in Computer Science, vol. 1897, pp. 20–31. Springer, Berlin (2000)
Bennell, J.A., Dowsland, K.A., Dowsland, W.B.: The irregular cutting-stock problem—a new procedure for deriving the no-fit polygon. Comput. Oper. Res. 28(3), 271–287 (2001)
Burkea, E.K., Helliera, R.S.R., Kendalla, G., Whitwell, G.: Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179(1), 27–49 (2007)
Ivanov, G.E.: Weak convexity in the senses of Vial and Efimov-Stechkin. Izv. Math. 69(6), 1113–1135 (2005)
Pansu, P.: “Quasiconvex” domains in ℝn. In: Gromov, M. (ed.) Metric Structures for Riemannian and Non-Riemannian Spaces, pp. 393–400. Birkhäuser, Boston (2001). Appendix A
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by the Dynasty Foundation.
Rights and permissions
About this article
Cite this article
Karasev, R.N. A Measure of Non-convexity in the Plane and the Minkowski Sum. Discrete Comput Geom 44, 608–621 (2010). https://doi.org/10.1007/s00454-010-9258-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-010-9258-z