Name
Abstract | ||
|---|---|---|
Irregular mesh depth sorting plays an important role for volume rendering in scientific visualization. In recent years, some algorithms have been proposed for the depth sorting of irregular convex meshes, but less attention has been devoted to the depth sorting of non-convex meshes. In this paper, two different approaches for converting non-convex meshes into convex meshes are proposed. The first one is to fill original meshes with a set of tetrahedra on the exterior boundaries of meshes. The second one is to take the plane of exterior faces of meshes to divide the space until each subspace includes only one acyclic convex submesh. The subdivision process is represented by a binary tree, Binary Mesh Partitioning tree (BMP tree). Theoretical analysis and experimental results are shown. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-60697-1_106 | ICSC |
Keywords | Field | DocType |
convert non-convex meshes,volume rendering,scientific visualization,binary tree | Data mining,Volume rendering,Polygon mesh,Computer graphics (images),3D rendering,Computer science,Volume mesh,Algorithm,Binary tree,Sorting,Regular polygon,Tetrahedron | Conference |
Volume | ISSN | ISBN |
1024 | 0302-9743 | 3-540-60697-1 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yong Zhou | 1 | 0 | 0.34 |
| Zesheng Tang | 2 | 149 | 28.27 |