Patterns used for supersampling in graphics have been analyzed from statistical and signal-processing viewpoints. We present an analysis based on a type of isotropic discrepancy - how good patterns are at estimating the area above an arbitrary edge through a pixel. An algorithm is presented for computing the worst-case discrepancy. Experimental evidence shows that popular supersampling patterns have discrepancies with better asymptotic behavior than random sampling, which is not inconsistent with theoretical bounds on discrepancy.
|Original language||English (US)|
|Number of pages||8|
|Journal||Proceedings - Graphics Interface|
|State||Published - Dec 1 1993|
All Science Journal Classification (ASJC) codes
- Hardware and Architecture