Conventional scene graphs use directed acyclic graphs; conventional iterated function systems use infinitely recursive definitions. We investigate scene graphs with recursive cycles for defining graphical scenes. This permits both conventional scene graphs and iterated function systems within the same framework and opens the way for other definitions not possible with either. We explore several mechanisms for limiting the implied recursion in cyclic graphs, including both global and local limits. This approach permits a range of possibilities, including scenes with carefully controlled and locally varying recursive depth. It has applications in art and design.
|Title of host publication||Computational Aesthetics 2010: Eurographics Workshop on Computational Aesthetics, London, United Kingdom, 2010|
|Editors||Pauline Jepp, Oliver Deussen|
|Publisher||Eurographics: European Association for Computer Graphics|
|Publication status||Published - 2010|
Wyvill, B., & Dodgson, N. (2010). Recursive scene graphs for art and design. In P. Jepp, & O. Deussen (Eds.), Computational Aesthetics 2010: Eurographics Workshop on Computational Aesthetics, London, United Kingdom, 2010 (pp. 33-40). Eurographics: European Association for Computer Graphics. https://doi.org/10.2312/COMPAESTH/COMPAESTH10/033-040