(i,j,k) refers to the vertices of a triangle. By this kind of indexing, we could store and retrieve the vertices more efficiently.

Are there data structures that allow us to store these vertex and triangle lists efficiently?

vectors? :)

Is this how SVG files stores geometric meshes?

@kckckc I don't know much about svg files, but I know this is similar to how meshes are stored in .ply files. The structure of a typical PLY file is:

Header Vertex List Face list (described by vertex indices) Lists of other elements

You can read more about it here: http://paulbourke.net/dataformats/ply/

@manuforo thanks for the good read!