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

来源：

INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, PROCEEDINGS | 2005年

关键词：

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 条

[41] Perfect KDB-tree:: A compact KDB-tree structure for indexing multidimensional data
Lin, HY
Huang, PW
THIRD INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND APPLICATIONS, VOL 2, PROCEEDINGS, 2005, : 411 - 414
[42] A high-capacity data-hiding approach for polygonal meshes using maximum expected level tree
Tu, Shih-Chun
Tai, Wen-Kai
COMPUTERS & GRAPHICS-UK, 2012, 36 (06): : 767 - 775
[43] AHF: array-based half-facet data structure for mixed-dimensional and non-manifold meshes
Dyedov, Vladimir
Ray, Navamita
Einstein, Daniel
Jiao, Xiangmin
Tautges, Timothy J.
ENGINEERING WITH COMPUTERS, 2015, 31 (03) : 389 - 404
[44] AHF: array-based half-facet data structure for mixed-dimensional and non-manifold meshes
Vladimir Dyedov
Navamita Ray
Daniel Einstein
Xiangmin Jiao
Timothy J. Tautges
Engineering with Computers, 2015, 31 : 389 - 404
[45] Efficient computation of the convex hull on sets of points stored in a k-tree compact data structure
Juan Felipe Castro
Miguel Romero
Gilberto Gutiérrez
Mónica Caniupán
Carlos Quijada-Fuentes
Knowledge and Information Systems, 2020, 62 : 4091 - 4111
[46] Efficient computation of the convex hull on sets of points stored in a k-tree compact data structure
Felipe Castro, Juan
Romero, Miguel
Gutierrez, Gilberto
Caniupan, Monica
Quijada-Fuentes, Carlos
KNOWLEDGE AND INFORMATION SYSTEMS, 2020, 62 (10) : 4091 - 4111
[47] An efficient edge based data structure for the compressible Reynolds-averaged Navier-Stokes equations on hybrid unstructured meshes
Akkurt, Semih
Sahin, Mehmet
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, 2022, 94 (01) : 13 - 31
[48] The benefits of using prefix tree data structure in multi-level frequent pattern mining
Pater, Mirela
Popescu, Daniela E.
SOFA 2007: 2ND IEEE INTERNATIONAL WORKSHOP ON SOFT COMPUTING APPLICATIONS, PROCEEDINGS, 2007, : 179 - +
[49] Flat tree-level inflationary potentials in the light of cosmic microwave background and large scale structure data
Ballesteros, G.
Casas, J. A.
Espinosa, J. R.
de Austri, R. Ruiz
Trotta, R.
JOURNAL OF COSMOLOGY AND ASTROPARTICLE PHYSICS, 2008, (03):
[50] A new three-level tree data structure for representing TSP tours in the Lin-Kernighan heuristic
Nguyen, Hung Dinh
Yoshihara, Ikuo
Yamamori, Kunihito
Yasunaga, Moritoshi
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007, E90A (10) : 2187 - 2193

← 1 2 3 4 5 →