Results 1 -
4 of
4
Zipper: A compact connectivity data structure for triangle meshes
"... We propose Zipper, a compact representation of incidence and adjacency for manifold triangle meshes with fixed connectivity. Zipper uses on average only 6 bits per triangle, can be constructed in linear space and time, and supports all standard randomaccess and mesh traversal operators in constant t ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
We propose Zipper, a compact representation of incidence and adjacency for manifold triangle meshes with fixed connectivity. Zipper uses on average only 6 bits per triangle, can be constructed in linear space and time, and supports all standard randomaccess and mesh traversal operators in constant time. Similarly to the previously proposed LR (Laced Ring) approach, the Zipper construction reorders vertices and triangles along a nearly Hamiltonian cycle called the ring. The 4.4x storage reduction of Zipper over LR results from three contributions: (1) For most triangles, Zipper stores a 2-bit delta (plus three additional bits) rather than a full 32-bit reference. (2) Zipper modifies the ring to reduce the number of exceptional triangles. (3) Zipper encodes the remaining exceptional triangles using 2.5x less storage. In spite of these large savings in storage, we show that Zipper offers comparable performance to LR and other data structures in mesh processing applications. Zipper may also serve as a compact indexed format for rendering meshes, and hence is valuable even in applications that do not require adjacency information. Key words: triangle meshes, mesh connectivity, Hamiltonian cycle, differential coding 1.
ESQ: Editable SQuad representation for triangle meshes
"... Abstract—We consider the problem of designing space efficient solutions for representing the connectivity information of manifold triangle meshes. Most mesh data structures are quite redundant, storing a large amount of information in order to efficiently support mesh traversal operators. Several co ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—We consider the problem of designing space efficient solutions for representing the connectivity information of manifold triangle meshes. Most mesh data structures are quite redundant, storing a large amount of information in order to efficiently support mesh traversal operators. Several compact data structures have been proposed to reduce storage cost while supporting constant-time mesh traversal. Some recent solutions are based on a global re-ordering approach, which allows to implicitly encode a map between vertices and faces. Unfortunately, these compact representations do not support efficient updates, because local connectivity changes (such as edge-contractions, edge-flips or vertex insertions) require reordering the entire mesh. Our main contribution is to propose a new way of designing compact data structures which can be dynamically maintained. In our solution, we push further the limits of the re-ordering approaches: the main novelty is to allow to re-order vertex data (such as vertex coordinates), and to exploit this vertex permutation to easily maintain the connectivity under local changes. We describe a new class of data structures, called Editable SQuad (ESQ), offering the same navigational and storage performance as previous works, while supporting local editing in amortized constant time. As far as we know, our solution provides the most compact dynamic data structure for triangle meshes. We propose a linear-time and linear-space construction algorithm, and provide worst-case bounds for storage and time cost. Keywords-triangle meshes; compact representations; dynamic data structures; I.
Computing
"... for their love and support, and for instilling the strength and self-belief to pursue my dreams. iii ACKNOWLEDGEMENTS I want to first thank my advisor Jarek Rossignac. Jarek’s brilliance and insights continue to amaze me, and I feel fortunate to have been advised by him. I am thankful for the many c ..."
Abstract
- Add to MetaCart
(Show Context)
for their love and support, and for instilling the strength and self-belief to pursue my dreams. iii ACKNOWLEDGEMENTS I want to first thank my advisor Jarek Rossignac. Jarek’s brilliance and insights continue to amaze me, and I feel fortunate to have been advised by him. I am thankful for the many conversations we had and advice he gave me on research and life in general. He is truly a wonderful mentor. I would like to thank my advisor David Frost. I worked with DF the whole time I was at Georgia Tech since my undergraduate days through my Master’s and finally my PhD. I am forever grateful to him for encouraging me to pursue a PhD. I always looked forward to the conversations we had over cups of latte discussing life and a broader vision on universities and research. His vision is inspiring and continues to
ESQ: Editable SQuad representation for
, 2013
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
- Add to MetaCart
(Show Context)
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
