Simplification of unstructured tetrahedral meshes by point sampling

Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics

Volumn , Issue , 2005, Pages 157-165

  Uesu, Dirce ^a   Bavoil, Louis ^a   Fleishman, Shachar ^a   Shepherd, Jason ^a   Silva, Cláudio T ^a  

^a UNIVERSITY OF UTAH   (United States)

Author keywords

Jevel of detail; Mesh simplification; Point sampling; Unstructured meshes

Indexed keywords

ALGORITHMS; DATA STRUCTURES; INTERACTIVE COMPUTER GRAPHICS; SAMPLING; TENSORS; VECTOR QUANTIZATION;

ISOSURFACES; JEVEL-OF-DETAIL; MESH SIMPLIFICATIONMESH SIMPLIFICATION; POINT SAMPLING; UNSTRUCTURED MESHES; VISUALIZATION ALGORITHMS;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 33745265663     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/vg.2005.194110     Document Type: Conference Paper

References (32)

1. [BHSG95] BOROUCHAKI H., HECHT F., SALTEL E., GEORGE P. L.: Reasonably efficient Delaunay based mesh generator in three dimensions. In the 4th International Meshing Roundtable (1995), pp. 3-14. 4,6
2. [CBF*04] CORRÈA W., BAVOIL L., FLEISHMAN S., JIMENEZ W., KLOSOWSKI J., MARTINS G., PESCO S., ROCHA L., SCHEIDEGGER C., SILVA C., UESU D.: Graphics Tool Box (GTB), 2004. http://sourceforge.net/projects/gtb. 6
3. [CCM*00] CIGNONI P., CONSTANZA D., MONTANI C., ROCCHINI C., SCOPIGNO R.: Simplification of tetrahedral meshes with accurate error evaluation, In IEEE Visualization 2000 (2000), pp. 85-92. 7
4. [CL03] CHIANG Y.-J., LU X.: Progressive simplification of tetrahedral meshes preserving all isosurface topologies. Computer Graphics Forum 22, 3 (2003), 493-504. 3, 7
5. [CM02] CHOPRA P., MEYER J.: Tetfusion: an algorithm for rapid tetrahedral mesh simplification. In IEEE Visualization 2002 (2002), pp. 133-140. 1, 3
6. [CPJ04] CO C., PORUMBESCU S., JOY K. I.: Meshless isosurface generation from multiblock data. In VisSym 2004 (2004), pp. 273-281. 8
7. [CSdVY02] COHEN-STEINER D., DE VERDIERE E. C., YVINEC M.: Conforming Delaunay triangulations in 3D. In the 18th Annual Symposium on Computational Geometry (2002), pp. 199-208. 4, 5
8. [CVM*96] COHEN J., VARSHNEY A., MANOCHA D., TURK G., WEBER H., AGARWAL P., BROOKS F., WRIGHT W.: Simplification envelopes. In SIGGRAPH 1996 (1996), pp. 119-128. 2,5
9. [Ebe04] EBERLY D. H.: 3D Game Engine Architecture: Engineering Real-Time Applications with Wild Magic. Morgan Kaufmann Publishers, 2004. 6
10. [Ede01] EDELSBRUNNER H.: Geometry and Topology for Mesh Generation. Cambridge University Press, 2001. 3
11. [FMSW00] FARIAS R., MITCHELL J., SILVA C., WYLIE B.: Tune-Critical Rendering of Irregular Grids. In the Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI) 2000 (2000), pp. 243-250. 2, 3
12. [GH97] GARLAND M., HECKBERT P. S.: Surface simplification using quadric error metrics. In SIGGRAPH 1997 (1997), pp. 209-216. 1,2,3
13. [GHJ*98] GIENG T. S., HAMANN B., JOY K. I., SCHUSSMAN G. L., TROTTS I. J.: Constructing hierarchies for triangle meshes. In IEEE Visualization 1998 (1998), pp. 145-161. 3
14. [GHS91] GEORGE P. L., HECHT F., SALTEL E.: Automatic mesh generator with specified boundary. Comput. Methods Appl. Mech. Eng. 92, 3 (1991), 269-288. 4, 6
15. [GVW99] GELDER A. V., VERNA V., WILHELMS J.: Volume decimation of irregular tetrahedral grids. Computer Graphics International 1999 (1999), 222-230. 3
16. [GZ05] GARLAND M., ZHOU Y.: Quadric-based simplification in any dimension. ACM Transactions on Graphics 24, 2 (Apr. 2005). 3,7
17. [Hop96] HOPPE H.: Progressive meshes. In SIGGRAPH 1996 (1996), pp. 99-108. 1,3
18. [LC87] LORENSEN W. E., CLINE H. E.: Marching cubes: A high resolution 3D surface construction algorithm. In SIGGRAPH 1987 (1987), pp. 163-169. 1
19. [LM99] LEUTENEGGER S., MA K.-L.: R-tree retrieval of unstructured volume data for visualization. In DIMACS Series of Discrete Masthematics and Theoretical Computer Science (May 1999), vol. 50, pp. 279-291. 8
20. [LT98] LINDSTROM P., TURK G.: Fast and memory efficient polygonal simplification. In IEEE Visualization 1998 (1998), pp. 279-286. 2, 5
21. [MHC90] MAX N., HANRAHAN P., CRAWFIS R.: Area and volume coherence for efficient visualization of 3D scalar functions. ACM SIGGRAPH Comput. Graph. 24, 5 (1990), 27-33. 1
22. [MMG00] MURPHY M., MOUNT D. M., GABLE. C. W.: A point-placement strategy for conforming Delaunay tetrahedralization. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms (2000), pp. 67-74. 4
23. [NE04] NATARAJAN V., EDELSBRUNNER H.: Simplification of three-dimensional density maps. IEEE Transactions on Visualization and Computer Graphics 10, 5 (2004), 587-597. 1,3
24. [Owe98] OWEN S. J.: A Survey of Unstructured Mesh Generation Technology. In 7th International Meshing Roundtable (1998). 3,6
25. [Pop03] POPINET S.: GNU Triangulated Surface (GTS) Library, Release 0.7.1, 2003. http://gts.sourceforge.net 2, 5, 6
26. [San04J SANDIA NATIONAL LABORATORIES: The CUBIT adaptive meshing algorithm library (CAMAL), release 2.0.2, 2004. http://cubit.sandia.gov. 4,6
27. [SG98] STAADT O. G., GROSS M. H.: Progressive tetrahedralizations. In IEEE Visualization 1998 (1998), pp. 397-402. 3
28. [She99] SHEWCHUK J. R.: Lecture Notes on Delaunay Mesh Generation. Tech. rep., University of California at Berkeley, 1999. 3
29. [THJ99] TROTTS I. J., HAMANN B., JOY K. I.: Simplification of tetrahedral meshes with error bounds. IEEE Transactions on Visualization and Computer Graphics 5, 3 (1999), 224-237. 3
30. [THJW98] TROTTS I. J., HAMANN B., JOY K. I., WILEY D. F.: Simplification of tetrahedral meshes. In IEEE Visualization 1998 (1998), pp. 287-295. 1, 3
31. [UBFS04] UESU D., BAVOIL L., FLEISHMAN S., SILVA C. T.: Simplification of Unstructured Tetrahedral Meshes by Point-Sampling. SCI Institute Technical Report UUSCI-2004-005, University of Utah, 2004. 6
32. [VCL*05] VO H. T., CALLAHAN S. P., LINDSTROM P., PASCUCCI V., SILVA C. T.: Streaming Simplification of Tetrahedral Meshes. Tech. rep., University of Utah, 2005. 7