Doubly linked face list

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In applied mathematics, a doubly linked face list (DLFL) is an efficient data structure for storing 2-manifold mesh data. The structure stores linked lists for a 3D mesh's faces, edges, vertices, and corners. The structure guarantees the preservation of the manifold property.[1][2]


  1. ^ Chen, Jianer (1997), "Algorithmic graph embeddings", Theoretical Computer Science, 181 (2): 247–266, MR 1465274, doi:10.1016/S0304-3975(96)00273-3 .
  2. ^ dos Santos, Thiago R.; Meinzer, Hans-Peter; Maier-Hein, Lena (2011), "Extending the doubly linked face list for the representation of 2-pseudomanifolds and 2-manifolds with boundaries", International Journal of Computational Geometry & Applications, 21 (4): 467–494, MR 2826033, doi:10.1142/S0218195911003767 .