Name
Abstract | ||
|---|---|---|
We propose a compact data structure for volumetric meshes of arbitrary topology and bounded valence that offers cell-face, face-edge, and edge-vertex incidence queries in constant time. Our structure is simple to implement, easy to use, and allows for arbitrary, user-defined 3-cells such as prisms and hexahedra, while remaining very efficient in memory usage compared to previous work. Its time complexity for commonly-used incidence and adjacency queries such as vertex and dart one-rings is analyzed. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.gmod.2012.10.001 | Graphical Models |
Keywords | Field | DocType |
commonly-used incidence,compact combinatorial map,bounded valence,edge-vertex incidence query,memory usage,dart one-rings,compact data structure,constant time,previous work,arbitrary topology,time complexity,volume mesh data structure,3d mesh | Adjacency list,Data structure,Discrete mathematics,Hexahedron,Mathematical optimization,Polygon mesh,Vertex (geometry),Algorithm,Volume mesh,Time complexity,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
75 | 3 | 1524-0703 |
Citations | PageRank | References |
1 | 0.39 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xin Feng | 1 | 1 | 0.72 |
| Yuanzhen Wang | 2 | 86 | 11.78 |
| Yanlin Weng | 3 | 492 | 15.36 |
| Yiying Tong | 4 | 977 | 46.77 |