Discrete Killing Fields for Pattern Synthesis and Symmetry Detection

Exploratory studies in symmetry detection show great promise for revolutionizing geometry analysis. Robust and efficient symmetry detection could be applied to any number of applications in storage, modeling, and surface generation. For instance, starting with some basic pieces of geometry, an approximation of a surface could be
built up using simple descriptions of how the geometry repeats and changes along a base layer. Such a structure could be used to reduce the complexity of geometry storage, enabling software in rendering, topography, and similar applications to process much more data with less redundancy and required space; rather than storing several copies of a repeated element, a single copy can be stored along with a list of ways in which it repeats.