Compact combinatorial maps: A volume mesh data structure

  • Authors:
  • Xin Feng;Yuanzhen Wang;Yanlin Weng;Yiying Tong

  • Affiliations:
  • Department of Computer Science and Engineering, Michigan State University, USA;Department of Computer Science and Engineering, Michigan State University, USA;College of Computer Science, Zhejiang University, China;Department of Computer Science and Engineering, Michigan State University, USA

  • Venue:
  • Graphical Models
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.