Random-edge discrepancy of supersampling patterns

David Paul Dobkin, Don P. Mitchell

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


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 languageEnglish (US)
Pages (from-to)62-69
Number of pages8
JournalProceedings - Graphics Interface
StatePublished - Dec 1 1993

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Software


Dive into the research topics of 'Random-edge discrepancy of supersampling patterns'. Together they form a unique fingerprint.

Cite this