Sampling Problems in Computer Graphics
The term “sampling” is ambiguous since it lends itself to a multitude of interpretations across various fields of study. In computer graphics, sampling problems arise in two distinct contexts. First, continuous functions (signals) are discretized via sampling. For example, a pixelated image represents an underlying continuous image signal sampled at the grid of pixel locations. The general problem is then of reconstructing a high-fidelity approximation of the continuous signal using the discretization. This application of sampling is heavily inspired by the wealth of literature in the digital signal processing community . The second category of sampling problems in computer graphics applications uses sampled values to estimate general characteristics of the sampled population . For example, in Monte Carlo image synthesis, samples of the radiance incident at each pixel are used to estimate the expected radiance at the pixel, using Monte Carlo integration. This article...
- 1.Oppenheim, A.V., Schafer, R.W.: Discrete-Time Signal Processing (Chap 4, ed. 3), (3rd edition) Prentice-Hall Signal Processing Series, Pearson (2009)Google Scholar
- 2.Botsch, M., Kobbelt, L., Pauly, M., Alliez, P., Levy, B.: Polygon Mesh Processing (2011)Google Scholar
- 4.Witkin, A., Baraff, D.: Physically based modeling: principles and practice. ACM SIGGRAPH course. http://www.cs.cmu.edu/~baraff/sigcourse/ (1997). Accessed 14 Feb 2013
- 5.Sifakis, E.D., Barbic, J.: FEM simulation of 3D deformable solids: a practitioner’s guide to theory, discretization and model reduction (part 1). ACM SIGGRAPH course. http://run.usc.edu/femdefo/sifakis-courseNotes-TheoryAndDiscretization.pdf (2012). Accessed 14 Feb 2013
- 6.Nealen A, Müller M, Keiser R, Boxerman E, Carlson M, Physically based deformable models in computer graphics. Computer Graphics Forum 2006;25(4):809–836Google Scholar
- 8.Shirley, P., Marschner, S.: Fundamentals of Computer Graphics (Chap. 24). CRC Press, Boca Raton (2009)Google Scholar