THE SMALLEST TRIANGULAR COVER FOR TRIANGLES OF DIAMETER ONE

  • YUAN LIPING (College of Mathematics and Information Science, Hebei Noraml University) ;
  • DING REN (College of Mathematics and Information Science, Hebei Noraml University)
  • Published : 2005.01.01

Abstract

A convex region covers a family of curves if it contains a congruent copy of each curve in the family, and a 'worm problem' for that family is to find the convex region of smallest area. In this paper, we find the smallest triangular cover of any prescribed shape for the family S of all triangles of diameter 1.

Keywords