Ilinkin, IvayloSousa Santos, Beatriz and Domik, Gitta2021-04-092021-04-092021978-3-03868-132-81017-4656https://doi.org/10.2312/eged.20211008https://diglib.eg.org:443/handle/10.2312/eged20211008This paper shares ideas for illustrating GLSL programming based on the classic Marching Cubes algorithm. The algorithm has a number of appealing aspects: it is feasible to implement as one of the components in a computer graphics course, it motivates naturally a number of GLSL concepts and constructs, and leaves the students with a sense of accomplishment having reproduced original research. The paper suggest possible variations and extensions that could form the basis for final group projects.Computing methodologiesComputer graphicsShape modeling10.2312/eged.2021100857-60