Antialiasing with Line Samples：抗锯齿线样品.pptVIP

Antialiasing with Line Samples Thouis R. Jones, Ronald N. Perry MERL - Mitsubishi Electric Research Laboratory Antialiasing Fundamentally a sampled convolution: Analytic Antialiasing Analytic antialiasing requires solving visibility to give a continuous 2D image Visible polygons tessellate image plane Arbitrarily complex shapes Efficient methods exist for evaluating the integral from 2D tessellation (Duff 1989, McCool 1995) Reduce Dimensionality - Point Sampling Point sampling reduces the dimension of the visibility calculation to 0D in image plane Pixel’s value is a weighted sum of values at sample points in the image plane Most widespread and well studied method for antialiasing geometry Reduce Dimensionality -1D Sampling Another option is to reduce the dimension by 1, and sample along 1D elements Prior Art: Max 1990 - Antialiasing Scan-Line Data Guenter Tumblin 1996 - Quadrature Prefiltering for High Quality Antialiasing Tanaka Takahashi 1990 - Cross Scanline Algorithm Prior Art - Max Sample along scanlines Analytic antialiasing in scanline direction, supersampling in other direction Extended in same paper to use edge slopes to better approximate 2D image before 2D filtering Prior Art - Guenter Tumblin Quadrature prefiltering - accurate numerical approximation of antialiasing integral Assumes existing 2D visibility solution Phrased as an efficient computation of the antialiasing integral, not as a sampling method As in Max 1990, unidirectional sampling Prior Art - Tanaka Takahashi Uses horizontal scanlines and vertical “sub-scanlines” to find 2D visibility solution Filters 2D image Again, not really phrased as a sampling method Line Sampling Small 1D samples - “line samples” Centered at pixel, spanning filter footprint Multiple line samples and sampling directions per pixel Line Sampling (continued) 1D filtering only - Cheaper/Faster 1D tables Edge slopes ignored in filtering Blending of samples based on image features Does use edge slopes... …but separ