fig10_33.cpp

经典书籍源代码啊。。。第三版。。。数据结构与算法分析——C++描述(第3版).

    // Points are all in the strip and sorted by $y$-coordinate

    for( i = 0; i < numPointsInStrip; i++ )
        for( j = i + 1; j < numPointsInStrip; j++ )
            if( $p_i$ and $p_j$'s $y$-coordinates differ by more than $\delta$ )
                break;        // Go to next $p_i$.
            else
            if( $\mvar{dist}(p_i, p_j) < \delta$ )
                $\delta$ = $dist(p_i, p_j)$;