Graphs in computer graphics

Žiga Lesar; Matija Marolt

doi:10.31449/upinf.204

Authors

Žiga Lesar UL FRI https://orcid.org/0000-0002-9850-0497
Matija Marolt UL FRI https://orcid.org/0000-0002-0619-8789

DOI:

https://doi.org/10.31449/upinf.204

Keywords:

graphs, networks, computer graphics

Abstract

This paper provides an overview of the main ideas of graph theory used in computer graphics. Applications include mesh compression, animation, visibility determination, rendering optimization, shape recognition, and navigation. We present both success and failure cases from the most cited works and recent publications. Related work review reveals a trend in using graphs for extracting the essential information from a given context, which directly manifests itself in various compression schemes and efficient querying data structures.

Author Biographies

Žiga Lesar, UL FRI

Žiga Lesar is a Ph.D. student, a researcher and a teaching assistant at the University of Ljubljana, Faculty of Computer and Information Science. He received his B.Sc. in 2014 and M.Sc. in 2018 for his work on interactive volume rendering with web technologies. His research is focused primarily on interactive computer graphics, especially volume rendering and visualization.

Matija Marolt, UL FRI

Matija Marolt is an associate professor at the University of Ljubljana, Faculty of Computer and Information Science. He received his Ph.D. in 2002 and is currently head of the Laboratory for Computer Graphics and Multimedia and is the chair for Multimedia. His research interests are in multimedia information retrieval and visualization.