Fig. 2.

Data structure diagram of a triangle represented using CASC. Each simplex is represented as a node containing a dictionary up and/or down which maps the vertex index to a pointer to the next simplex. Data can be stored at each node with type determined at compile time. Effectively each level can contain different metadata as defined by the user, separating the interactions of user data from the representation of topology.