Doubly_linked_face_list

Doubly linked face list

Doubly linked face list

Add article description

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]

References

  1. [1]
    Chen, Jianer (1997), "Algorithmic graph embeddings", Theoretical Computer Science, 181 (2): 247–266, doi:10.1016/S0304-3975(96)00273-3, MR 1465274.
  2. [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, doi:10.1142/S0218195911003767, MR 2826033.


Stub icon

This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.
Share this article:

This article uses material from the Wikipedia article Doubly_linked_face_list, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.