An interesting variant of polygon approximation problems is described: for a given convex polygon P, which of the smallest k-gonal enclosures for P, kor=3, has minimum area? A proof of the finite nature of the value of k which answers this problem (the Kosaraju number of the polygon), as well as several of its other versions, is outlined. The provable upper bounds on Kosaraju numbers turn out to be exponential in the number of edges of the enclosed polygon, making the search for exact values potentially intractable. It is shown that when the polygons involved are the simplest possible-triangles-the Kosaraju number is always equal to 3.
展开▼
