The Half-Edge Tree: A compact data structure for Level-Of-Detail tetrahedral meshes

被引:0
|
作者
Danovaro, E [1 ]
De Floriani, L [1 ]
Magillo, P [1 ]
Puppo, E [1 ]
Sobrero, D [1 ]
Sokolovsky, N [1 ]
机构
[1] Univ Genoa, DISI, Genoa, Italy
关键词
D O I
10.1109/SMI.2005.47
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We propose a new data structure for the compact encoding of a Level-Of-Detail (LOD) model of a three-dimensional scalar field based on unstructured tetrahedral meshes. Such data structure, called a Half-Edge Tree (HET), is built through the iterative application of a half-edge collapse, i.e. by contracting an edge to one of its endpoints. We also show that selective refined meshes extracted from an HET contain on average about 34 % and up to 75 % less tetrahedra than those extracted from an LOD model built through a general edge collapse.
引用
收藏
页码:332 / 337
页数:6
相关论文
共 50 条
  • [11] A survey on data structures for level-of-detail models
    De Floriani, L
    Kobbelt, L
    Puppo, E
    ADVANCES IN MULTIRESOLUTION FOR GEOMETRIC MODELLING, 2005, : 49 - 74
  • [12] Contour tracking using modified Canny edge maps with level-of-detail
    Park, J
    COMPUTER ANALYSIS OF IMAGES AND PATTERNS, PROCEEDINGS, 2005, 3691 : 1 - 8
  • [13] Object tracking and elimination using Level-of-Detail canny edge maps
    Park, Jihun
    ARTICULATED MOTION AND DEFORMABLE OBJECTS, PROCEEDINGS, 2006, 4069 : 281 - 290
  • [14] Half-edge composite structure: good performance in motion matching
    Qian, Jiang
    Luo, Xiaohui
    Xue, Yilan
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2021,
  • [15] Object boundary edge selection using level-of-detail canny edges
    Park, J
    Park, S
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 4, 2004, 3046 : 369 - 378
  • [16] Feature-Preserving Triangular Geometry Images for Level-of-Detail Representation of Static and Skinned Meshes
    Feng, Wei-Wen
    Kim, Byung-Uck
    Yu, Yizhou
    Peng, Liang
    Hart, John
    ACM TRANSACTIONS ON GRAPHICS, 2010, 29 (02):
  • [17] COMPUTING ARBITRARILY LARGE MESHES WITH LEVEL-OF-DETAIL SUPPORT FOR CESIUM 3D TILES
    Hillmann, Malte
    Igelbrink, Felix
    Wiemann, Thomas
    7TH INTERNATIONAL WORKSHOP LOWCOST 3D - SENSORS, ALGORITHMS, APPLICATIONS, 2022, 48-2 (W1): : 109 - 116
  • [18] Optimizing Grid Layouts for Level-of-Detail Exploration of Large Data Collections
    Frey, S.
    COMPUTER GRAPHICS FORUM, 2022, 41 (03) : 247 - 258
  • [19] Computer Aided Design Technology for Convex Faceted Gem Cuts Based on the Half-Edge Data Structure
    Linhong Xu
    Xiangnan Li
    Jianhua Rao
    Yuan Han
    Zhipeng Li
    Jichun Li
    JournalofBeijingInstituteofTechnology, 2019, 28 (03) : 585 - 597
  • [20] Computer Aided Design Technology for Convex Faceted Gem Cuts Based on the Half-Edge Data Structure
    Xu L.
    Li X.
    Rao J.
    Han Y.
    Li Z.
    Li J.
    Journal of Beijing Institute of Technology (English Edition), 2019, 28 (03): : 585 - 597