Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.2312/COMPAESTH/COMPAESTH10/033-040 | Computational Aesthetics |
Keywords | Field | DocType |
iterated function system,infinitely recursive definition,graphical scene,acyclic graph,conventional scene graph,varying recursive depth,recursive cycle,scene graph,conventional iterated function system,recursive scene graph,cyclic graph | Graph,Iterated function system,Computer science,Theoretical computer science,Directed acyclic graph,Limiting,Recursion | Conference |
Citations | PageRank | References |
1 | 0.48 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brian Wyvill | 1 | 1130 | 278.50 |
| Neil A. Dodgson | 2 | 723 | 54.20 |