Jump to content

Doubly linked face list

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Senator2029 (talk | contribs) at 19:03, 21 September 2013 (Added {{expert-subject}} and {{unreferenced}} tags to article (TW)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article needs attention from an expert in Mathematics. Please add a reason or a talk parameter to this template to explain the issue with the article. WikiProject Mathematics may be able to help recruit an expert. (September 2013)

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Doubly linked face list" – news · newspapers · books · scholar · JSTOR (September 2013) (Learn how and when to remove this message)

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.

This data structure is used by the 3D modeling software TopMod.

This applied mathematics–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Doubly_linked_face_list&oldid=573947564"

Hidden categories: