Scene Graph Implementation
The simplest form of scene graph uses an array or linked list data structure, and displaying its shapes is simply a matter of linearly iterating the nodes one by one. Other common operations, such as checking to see which shape intersects the mouse pointer (e.g., in a GUI-based applications) are also done via linear searches. For small scene graphs, this tends to suffice.
Larger scene graphs cause linear operations to become noticeably slow and thus more complex underlying data structures are used, the most popular and common form being a tree. In these scene graphs, the composite design pattern is often employed to create the hierarchical representation of group nodes and leaf nodes.
Group nodes — Can have any number of child nodes attached to it. Group nodes include transformations and switch nodes.
Leaf nodes — Are nodes that are actually rendered or see the effect of an operation. These include objects, sprites, sounds, lights and anything that could be considered 'rendered' in some abstract sense.
Read more about this topic: Scene Graph
Famous quotes containing the words scene and/or graph:
“Last scene of all,
That ends this strange eventful history,
Is second childishness, and mere oblivion,
Sans teeth, sans eyes, sans taste, sans every thing.”
—William Shakespeare (1564–1616)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)