A Measure of Non-convexity in the Plane and the Minkowski Sum

Discrete and Computational Geometry

Volumn 44, Issue 3, 2010, Pages 608-621

  Karasev, R N ^a  

^a MOSCOW INSTITUTE OF PHYSICS AND TECHNOLOGY   (Russian Federation)

Author keywords

Minkowski sum; Weak convexity

Indexed keywords

EID: 77955769218     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-010-9258-z     Document Type: Article

References (5)

1. 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).
2. 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).
3. 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).
4. Ivanov, G. E.: Weak convexity in the senses of Vial and Efimov-Stechkin. Izv. Math. 69(6), 1113-1135 (2005).
5. n. In: Gromov, M. (ed.) Metric Structures for Riemannian and Non-Riemannian Spaces, pp. 393-400. Birkhäuser, Boston (2001). Appendix A.