Advanced Computer Graphics - SS 2021
This course will introduce students to advanced and more complex methods and techniques of computer graphics. Some of the topics that were touched upon in the Bachelor course "Computer Graphics" will be covered in more depth. In addition, more and other topics will be covered that were not taught in the Bachelor's course. This approach will both broaden and deepen students' knowledge about the field of computer graphics.
This course is for you, if you want to acquire ...
- Knowledge of advanced and more complex methods and techniques of computer graphics.
- Mastering of some of the topics that were already touched upon in the basic computer graphics course, by expanding them in greater depth.
- Ability to follow the current research literature on those topics.
- Skills to implement complex techniques in those areas.
- Knowledge of the principles of photorealistic image generation.
- Larger overview over the amazing wealth of topics and research questions in computer graphics,
There are no formal prerequisites, but some degree of the following skills are desirable:
- A little bit of experience with C/C++ ; note that you will need just "C with classes" during this course.
- Knowledge of the material of the Bachelor course "Computer Graphics" (if you didn't manage to attend that course, you can easily recap that material for yourself).
- Algorithmic thinking (and, hopefully, some pleasure when thinking about algorithms)
Some of the envisioned topics (these can change during the semester):
- Data structures and the theory of boundary representations (meshes);
- Advanced texturing methods;
- Generalized barycentric coordinates and parameterization of meshes;
- Advanced shader programming (special effects);
- Culling techniques (real-time rendering);
- Ray-tracing (photo-realistic images);
- Alternative object representations (modeling);
- Mesh processing
Starting date: 22. April, 10h ct.
Zoom: the link will be announced in an email via Studip.
Twitch: join the channel https://www.twitch.tv/gabzach
Discord: https://discord.gg/YGUZFxf This is meant for you to ask questions during the (live) lecture; also, I encourage you to use this for discussions and Q&A amongst yourselves. (Rest assured that I don't have time to "listen" in to your chatting on discord ;-) )
You can get direct one-on-one help regarding C++ and compilation on the Discord server CGVRUniBremen https://discord.gg/YGUZFxf in the channel #one-on-one-help-with-marc
FolienThe following table contains the topics and the accompanying slides (it will be filled step-by-step).
Ray-tracing 1: principle, the rendering equation, Whitted-style ray-tracing, camera models, lighting model, reflected rays, refraction, Fresnel terms, attenuation, scattering, dispersion, intersection ray-polygon, intersection ray-triangle, intersection ray-box, ray-sphere intersection,
|2.||Ray-tracing 2: ray-tracing height fields, numerical robustness, limitations of Whitted-style ray-tracing, distribution ray-tracing, stratified and Poisson disk sampling, grid-based construction algorithm, Poisson disk sampling on the sphere, distribution raytracing: anti-aliasing, soft shadows, glossy-matte reflection, depth-of-field, motion blur.|
|3.||Object representations 1: quadrics and superquadrics, implicit surfaces, sure-fire root finding methods (regula falsi, Illinois), metaballs, generalizations, polygonization of implicit surfaces using marching cubes, instancing,|
Object representations 2:
constructive solid geometry (definition, ray-tracing, polygonization)
Acceleration data structures 1: taxonomy, light buffer, beam and cone tracing, bounding volumes, 3D grids and spatial hashing, traversal of grids, mailbox technique, optimal grid resolution, recursive & hierarchical grid, irregular grids (construction and ray traversal) proximity clouds (sphere tracing),
Acceleration data structures 2:
kd-trees, ray traversal using kd-trees,
surface area heuristic (SAH),
efficient storage of kd-trees,
spatial v. object partitioning,
bounding volume hierarchies (BVHs),
BVH traversal using a p-queue, principles of construction of BVHs,
median cut heuristic,
plane sweep along principal axis with SAH.
Collision Detection: requirements, collision detection pipeline, collision matrix, broad phase, narrow phase, 3D grid, temporal coherence, broad phase algo using separating planes, hierarchical collision detection, bounding volume, BV hierarchies for coll.det., k-DOPs, inner sphere trees, penetration measures,
Culling and visibility: bottlenecks in the rendering pipeline, types of culling,
normal masks, clustered backface culling,
hierarchical clustered backface culling,
view frustum culling, hierarchical view frustum culling,
occlusion culling, batched occlusion queries, naive wait-and-draw algorithm,
|8.||Advanced shader techniques: recap of programmable pipeline and GLSL, procedural textures in the shader, value noise, gradient noise, example: procedural textures with noise (brick texture), ambient occlusion, refractive objects, the geometry shader, simple examples, rendering furry objects with shells and fins, rendering silhouettes.|
|9.||Advanced texturing methods: seams, texture atlas, cube maps, polycube maps, concept of environment mapping, spherical environment mapping, cube environment mapping, dynamic environment mapping, parallax mapping, view-dependent displacement mapping (VDM), VDM with self-shadowing.|
calculating good vertex normals,
orienting meshes consistently,
Laplacian smoothing, extension to prevent shrinking,
global Laplacian smoothing,
subdivison surfaces (Catmull-Clark).
Boundary Representations 1: definitions, orientability, 2-manifold, homeomorphism, OBJ file format, indexed face set, doubly-connected edge list (half-edge data structure), mesh traversals using a a DCEL, limitations of DCEL, mesh matrices and example applications,
Boundary Representations 2:
Euler equation, complexity of polyhedra,
Platonic solids, Euler characteristic,
regular quad meshes.
Striping/Stripification: concepts, NP-completeness, SGI algorithm, FTSG algorithm.
Generalized Barycentric Coordinates: definition,
interpolation property with proof,
general construction scheme and properties,
mean value coordinates,
extension to non-convex polygons,
applications: image warping,
Parameterization: general approach, condition for and proof of a unique solution, concrete parameterizations.
seashells, fractal terrain modeling,
terrain modelling using fault lines,
L-systems: definition, turtle graphics,
parametric L-systems, stochastic L-systems,
procedural modeling rocks using genetic algorithms.
Call for theses
|10.||Tone mapping: HDR imaging, image histograms, histogram stretching, histogram equalization, tone reproduction using CLAHE, the Weber-Fechner law, Steven's power law, perceptually-based tone mapping, generating histograms on the GPU.|
You can download some of the shaders that were discussed in class, plus some some very simple ones (discussed in the Bachelor course).
Video Recordings of the Lecture from SS 21
The videos are encoded with H.265/HEVC and should play fine with Safari and IE. With Chrome and Firefox, you might need to download the videos, or install a plugin/extension.
The following textbooks can help review the material covered in class:
- Andrew Glassner (ed.): An Introduction to Ray Tracing; Morgan Kaufman
- Peter Shirley: Realistic Ray Tracing; AK Peters.
- Tomas Akenine-Möller, Eric Haines: Real-Time Rendering; AK Peters.
- Matt Pharr, Wenzel Jakob, Greg Humphreys: Physically-Based Rendering; Morgan Kaufmann. (Commonly referred to as PBRT)
- Alan Watt, Mark Watt: Advanced Animation and Rendering Techniques. Addison-Wesley
- Online Literature, see below
- Foley, van Dam, Feiner, Hughes: Computer Graphics -- Principles and Practice; Addison Wesley.
Please note that the course is not based on one single textbook! Some topics might even not be covered in any current textbook! So, I'd suggest you first look at the books in the library before purchasing a copy.
If you plan on buying one of these books, you might want to consider buying a used copy -- they can often be purchased for a fraction of the price of a new one. Two good used book shops on the internet are Abebooks and BookButler.
Additional Literature and Demos for Deeper Insights
- On Raytracing (global illumination):
- Siggraph course on Physically-Based Shading Models in Film and Game Production by Naty Hoffman (Activision Studio Central), Yoshiharu Gotanda, Adam Martinez (Sony), Ben Snow (ILM), 2010 (source).
- An animated video explaining the rendering equation by Matthias Parchettka; it's only in German (ist ein wenig albern, aber vielleicht trotzdem hilfreich; source).
- Siggraph course notes on ray-tracing and photon mapping by Henrik Wann Jensen (UCSD) and Per Christensen (Pixar), 2008.
- The classic book Principles of Digital Image Synthesis by Andrew Glassner, 1995.
- Siggraph course notes on interactive ray-tracing, 2006.
- Alex Ryer: Light Measurement Book (source); explains a lot of the principles of light sources, light perception, and light transportation.
- Siggraph course notes on implicit surfaces, 1996.
- Literature on advanced texturing techniques:
- The tutorial OpenGL cube map texturing by NVIDIA, 1999.
- Siggraph course notes lighting and shading techniques for interactive applications , 1999 (chapters 6, 10, and 11).
- On GLSL and shader programming:
- Introductory material (e.g., IDEs and tutorials) can be found here on the bachelor course's web page.
- An easy introduction to simplex noise by Stefan Gustavson (source).
- A fairly comprehensive explanation of Spherical, Cubic, and Parabolic Environment Mappings by Paul Zimmons.
- On Culling:
- Hansong Zhang, Kenneth E. Hoff III: Fast Backface Culling Using Normal Masks
- Andreas Johannsen, Michael B. Carter: Clustered Backface Culling
- Ulf Assarsson and Tomas Möller: Optimized View Frustum Culling Algorithms for Bounding Boxes
- Lighthouse 3D: View Frustum Culling Tutorial
- Literature complementing the chapter on boundary representations:
- A paper on array-based mesh data structures (for our course, only the first part is relevant)
- A nice tutorial on the DCEL data structure by Ryan Holmes (source)
- A tutorial on specification, representation, and construction of non-manifold geometric structures (this is only partially relevant for our course, but it can serve as an outlook on how to extend the concepts into n-dimensional geometry)
- Two essays on the Euler characteristic: one by Edward Early (source), and one by Sudesh Kalyanswamy (source), the latter being more geared towards graphs, but still relevant in computer graphics, too.
- A simple proof of the Jordan Curve Theorem for the important class of polygons (source)
- Similar to regular polyhedra, one can even define Infinite Regular Polyhedra, and, here too, the genus plays a very important characterizing role (source)
- Literature on generalized barycentric coordinates:
- Hormann & Floater: Mean Value Coordinates for Arbitrary Planar Polygons
- Surazhsky & Gotsman: Intrinsic Morphing of Compatible Triangulations
- Floater: Mean Value Coordinates
- The SIGGRAPH 2007 course notes on Mesh Parameterization by Kai Hormann, Bruno Levy, and Alla Sheffer. (Source)
- Literature and links on L-systems:
- The wonderful book The Algorithmic Beauty of Plants by Przemyslaw Prusinkiewicz and Aristid Lindenmayer, 2004. (Source)
- Arbaro is a free software to generate tree models for povray.
- A tutorial on the PCA by Prof. Laurenz Wiskott, 2004. (Source)
Other Interesting Bits and Pieces
- Not exactly about computer graphics, but here is a clip from an interview with Linus Torvalds, where he speaks about tasteful code. And although he does not explicitely mention it, I strongly believe that tasteful code is what makes robust code. (Source: Linus Torvalds: The mind behind Linux, February 2016 at TED2016.)
- Interview with Vint Cerf, one of the fathers of the Internet (think TCP/IP, not HTML). He begins with its inception, continues through its evolution, and touches upon the future.
Last modified: Wed Aug 04 15:48:27 MDT 2021