Premium
CPH: A Compact Representation for Hierarchical Meshes Generated by Primal Refinement
Author(s) -
Untereiner L.,
Kraemer P.,
Cazier D.,
Bechmann D.
Publication year - 2015
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12667
Subject(s) - polygon mesh , tree traversal , representation (politics) , computer science , data structure , subdivision , set (abstract data type) , hierarchy , surface (topology) , theoretical computer science , manifold (fluid mechanics) , mathematics , algorithm , topology (electrical circuits) , combinatorics , computer graphics (images) , geometry , mechanical engineering , archaeology , politics , political science , economics , law , market economy , history , programming language , engineering
We present CPH ( Compact Primal Hierarchy ): a compact representation of the hierarchical connectivity of surface and volume manifold meshes generated through primal subdivision refinements. CPH is consistently defined in several dimensions and supports multiple kinds of tessellations and refinements, whether regular or adaptive. The basic idea is to store only the finest mesh, encoded in a classical monoresolution structure that is enriched with a minimal set of labels. These labels allow traversal of any intermediate level of the mesh concurrently without having to extract it in an additional structure. Our structure allows attributes to be stored on the cells not only on the finest level, but also on any intermediate level. We study the trade‐off between the memory cost of this compact representation and the time complexity of mesh traversals at any resolution level.