Doubly linked face list
From HandWiki
Revision as of 19:02, 27 September 2021 by imported>Nautica (linkage)
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
- ↑ Chen, Jianer (1997), "Algorithmic graph embeddings", Theoretical Computer Science 181 (2): 247–266, doi:10.1016/S0304-3975(96)00273-3.
- ↑ 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.
 |  |
