Computing the rectangle discrepancy
暂无分享,去创建一个
This is the animation of an algorithm that computes the rectangle discrepancy of a two-dimensional point set. Our main motivation comes from sampling problems in computer graphics. Supersampling is one of the most general ways of attacking antialiasing. In this approach we sample the picture at a very high rate, and then we resample by averaging supersamples within the pixel area to compute the pixel value. Ray tracing, a technique used to produce realistic images of computer modeled scenes, is another instance of supersampling. Here we sample the radiance at a set of points in each pixel.
[1] Wolfgang Maass,et al. Efficient agnostic PAC-learning with simple hypothesis , 1994, COLT '94.
[2] Franco P. Preparata,et al. An optimal real-time algorithm for planar convex hulls , 1979, CACM.
[3] David P. Dobkin,et al. GASP: a system to facilitate animating geometric algorithms , 1994, SCG '94.
[4] David Eppstein,et al. Computing the discrepancy , 1993, SCG '93.