34-Issue 8

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/14685

Browse

Browsing 34-Issue 8 by Subject "data structures"

Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    CPH: A Compact Representation for Hierarchical Meshes Generated by Primal Refinement
    (Copyright © 2015 The Eurographics Association and John Wiley & Sons Ltd., 2015) Untereiner, L.; Kraemer, P.; Cazier, D.; Bechmann, D.; Deussen, Oliver and Zhang, Hao (Richard)
    We present CPH (): 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.We present CPH (): 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.