The head of a monkey is rendered times at different locations.
The main objective of this work is inspired by a concept in the field of computer graphics called instancing. In instancing approaches, a geometry template is defined which is then inserted into a scene multiple times at different locations, often also slightly modified. Figure 4.1 shows a simple example of instancing in computer graphics.
The main idea of this work is to decompose geometries and meshes into smaller parts, called blocks, where as many blocks as possible are similar to each other to obtain high improvements in memory usage and algorithm runtime.
In this chapter, geometry and mesh templates - and their instances - are defined and some of their properties are presented and discussed.
General decompositions as well as the basics of templated structures are covered in Section 4.1.
Section 4.2 discusses interfaces of templated structures as well as conformity issues.
The boundary patch partition, a mechanism to identify dependencies and constraints, is presented in
Section 4.3.
The Delaunay property for templated meshes is discussed in Section 4.4.
Finally, in Section 4.5, two different data structures for storing templated meshes are presented.
