矩形条覆盖问题的贪心算法

A Greedy Algorithm for Rectangle Cover Problem

讨论了计算几何学中的矩形条覆盖问题 ,提出解决该问题的一个有效算法 ,并对提出的算法进行了分析 .

This paper discusses the problem of covering an ordered point set by a sequence of rectangles with minimum width in the area of computational geometry. An efficient algorithm is presented and analyzed.