返回
Zipper: A compact connectivity data structure for triangle meshes
DOI:10.1016/j.cad.2012.10.009.png)
摘要
En 中文
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 random-access 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. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Triangle meshes
Mesh connectivity
Hamiltonian cycle
Differential coding
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.2K
被引数:
6.4K
机构
引用论文
Synthesis and Structural Characterization of Bimetallic Salt [Ni(phen)3][Ni(mnt)2] and [Ni(bpy)3][Ni(mnt)2]双金属盐[Ni(phen)3][Ni(mnt)2]和[Ni(bpy)3][Ni(mnt)2]的合成与结构表征
Octave Spanning Mid-Infrared Frequency Comb Generation in Silicon Nanophotonic Wire Waveguides
CLEO: 2014
IF0

