基于最佳逼近的以段为步长的直线算法

证明了直线在最佳逼近中的与下逼近不同的一些性质。然后利用这些性质，提出了基于最佳逼近的以段为步长的直线算法。该算法和基于下逼近的以段为步长的算法相比，既保持了计算效率，又提高了计算精度。理论分析表明该算法效率优于Brensenham、双步、三步、四步等直线算法。图形设备的硬件层实现该算法将更加有效。

Span-by-span Algorithm for Straight Line Based on Best Approximation

The paper suggests and proves some properties of straight line under the condition of the best approximation that are different from the corresponding ones under the condition of the low approximation. Then, a span-by-span algorithm for straight line based on best approximation is deduced from these properties. Comparing with the span-by-span algorithm based on low approximation, the new one holds better precision and equally efficiency. A theoretical analysis demonstrates that it is faster than such previous algorithms as Bresenham’s, double-step, triple-step, and quad-step algorithm. Hardware implementation will be more efficient.