CPH: A Compact Representation for Hierarchical Meshes Generated by Primal Refinement

Eurographics DL Repository

Show simple item record

dc.contributor.author Untereiner, L. en_US
dc.contributor.author Kraemer, P. en_US
dc.contributor.author Cazier, D. en_US
dc.contributor.author Bechmann, D. en_US
dc.contributor.editor Deussen, Oliver and Zhang, Hao (Richard) en_US
dc.date.accessioned 2016-01-25T14:31:26Z
dc.date.available 2016-01-25T14:31:26Z
dc.date.issued 2015 en_US
dc.identifier.uri /
dc.identifier.uri http://dx.doi.org/10.1111/cgf.12667 en_US
dc.description.abstract 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. en_US
dc.publisher Copyright © 2015 The Eurographics Association and John Wiley & Sons Ltd. en_US
dc.subject multiresolution representations en_US
dc.subject data structures en_US
dc.subject subdivision en_US
dc.subject levels of detail en_US
dc.subject adaptive subdivision en_US
dc.subject Computer Graphics [I.3.5] Object hierarchies Boundary representations Methodology and Techniques I.3.6 Graphics data structures and data types en_US
dc.title CPH: A Compact Representation for Hierarchical Meshes Generated by Primal Refinement en_US
dc.description.seriesinformation Computer Graphics Forum en_US
dc.description.sectionheaders Articles en_US
dc.description.volume 34 en_US
dc.description.number 8 en_US
dc.identifier.doi 10.1111/cgf.12667 en_US


Files in this item

Pay-Per-View via TIB Hannover:

Try if this item/paper is available.

This item appears in the following Collection(s)

Show simple item record

Search Eurographics DL


Browse

My Account