| 词条 | Doubly linked face list |
| 释义 |
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] References1. ^{{citation | last = Chen | first = Jianer | doi = 10.1016/S0304-3975(96)00273-3 | issue = 2 | journal = Theoretical Computer Science | mr = 1465274 | pages = 247–266 | title = Algorithmic graph embeddings | volume = 181 | year = 1997}}. {{Applied-math-stub}}2. ^{{citation | last1 = dos Santos | first1 = Thiago R. | last2 = Meinzer | first2 = Hans-Peter | last3 = Maier-Hein | first3 = Lena | doi = 10.1142/S0218195911003767 | issue = 4 | journal = International Journal of Computational Geometry & Applications | mr = 2826033 | pages = 467–494 | title = Extending the doubly linked face list for the representation of 2-pseudomanifolds and 2-manifolds with boundaries | volume = 21 | year = 2011}}. 3 : 3D imaging|Applied mathematics|Linked lists |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。