ACM Home Page
Please provide us with feedback. Feedback
Technical strategies for massive model visualization
Full text PdfPdf (1.03 MB)
Source
ACM Symposium on Solid and Physical Modeling archive
Proceedings of the 2008 ACM symposium on Solid and physical modeling table of contents
Stony Brook, New York
SESSION: Mini-symposia table of contents
Pages 405-415  
Year of Publication: 2008
ISBN:978-1-60558-106-2
Authors
Enrico Gobbetti  CRS4
Dave Kasik  Boeing
Sung-eui Yoon  KAIST
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 126,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1364901.1364960
What is a DOI?

ABSTRACT

Interactive visualization of massive models still remains a challenging problem. This is mainly due to a combination of ever increasing model complexity with the current hardware design trend that leads to a widening gap between slow data access speed and fast data processing speed. We argue that developing efficient data access and data management techniques is key in solving the problem of interactive visualization of massive models. Particularly, we discuss visibility culling, simplification, cache-coherent layouts, and data compression techniques as efficient data management techniques that enable interactive visualization of massive models.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
5
 
6
Alliez, P., and Gotsman, C. 2005. Recent advances in compression of 3D meshes. Springer, 3--26.
 
7
Andújar, C., Saona-Vázquez, C., and Navazo, I. 2000. Lod visibility culling and occluder synthesis. Computer-Aided Design 32, 13 (Oct.), 773--783.
 
8
9
 
10
 
11
Bittner, J., Wimmer, M., Piringer, H., and Purgathofer, W. 2004. Coherent hierarchical culling: Hardware occlusion queries made useful. Computer Graphics Forum 23, 3, 615--624.
 
12
Bittner, J. 2002. Hierarchical Techniques for Visibility Computations. Ph.d. thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague.
13
 
14
Choe, S., Kim, J., Lee, H., Lee, S., and Seidel, H.-P. 2004. Mesh compression with random accessibility. In Israel-Korea Bi-National conf.
 
15
 
16
Cignoni, P., Ganovelli, F., Gobbetti, E., Marton, F., Ponchio, F., and Scopigno, R. 2003. BDAM -- batched dynamic adaptive meshes for high performance terrain visualization. Computer Graphics Forum 22, 3 (September), 505--514. Proc. Eurographics 2003.
 
17
18
 
19
Cignoni, P., Ganovelli, F., Gobbetti, E., Marton, F., Ponchio, F., and Scopigno, R. 2005. Batched multi triangulation. In Proceedings IEEE Visualization, IEEE Computer Society Press, Conference held in Minneapolis, MI, USA, 207--214.
 
20
Cignoni, P., Di Benedetto, M., Ganovelli, F., Gobbetti, E., Marton, F., and Scopigno, R. 2007. Ray-Casted BlockMaps for Large Urban Models Visualization. In Computer Graphics Forum (Proceedings of Eurographics). To appear.
 
21
 
22
de Toledo, R., and Levi, B. 2004. Extending the graphic pipeline with new GPU-accelerated primitives. In Proc. 24th gOcad Meeting.
 
23
De Toledo, R., Levy, B., and Paul, J.-C. 2007. Iterative methods for visualization of implicit surfaces on gpu. In ISVC, International Symposium on Visual Computing, Springer, Lake Tahoe, Nevada/California, Lecture Notes in Computer Science.
24
 
25
Dietrich, A., Schmittler, J., and Slusallek, P. 2006. World-space sample caching for efficient ray tracing of highly complex scenes. Tech. Rep. TR-2006-01, Computer Graphics Group, Saarland University.
26
 
27
 
28
Durand, F. 1999. 3D Visibility: Analytical study and Applications. PhD thesis, Universite Joseph Fourier, Grenoble, France.
 
29
Gobbetti, E., and Marton, F. 2004. Layered point clouds: a simple and efficient multiresolution structure for distributing and rendering gigantic point-sampled models. Computers & Graphics 28, 6 (Dec.), 815--826.
30
 
31
Gobbetti, E., Marton, F., Cignoni, P., Di Benedetto, M., and Ganovelli, F. 2006. C-BDAM -- compressed batched dynamic adaptive meshes for terrain rendering. Computer Graphics Forum 25, 3 (September), 333--342. Proc. Eurographics 2006.
 
32
 
33
34
 
35
Gotsman, C., Gumhold, S., and Kobbelt, L. 2002. Simplification and Compression of 3D Meshes. Springer, 319--361.
36
 
37
Grossman, J., and Dally, W. J. 1998. Point Sample Rendering. In Rendering Techniques 1998 (Proceedings of the Eurographics Workshop on Rendering), 181--192.
38
 
39
Haumont, D., Makinen, O., and Nirenstein, S. 2005. A low dimensional framework for exact polygon-to-polygon occlusion queries. In Rendering Techniques, Eurographics Association, O. Deussen, A. Keller, K. Bala, P. Dutr?, D. W. Fellner, and S. N. Spencer, Eds., 211--222.
 
40
Havran, V., Herzog, R., and Seidel, H.-P. 2006. On the fast construction of spatial data structures for ray tracing. In Proceedings of IEEE Symposium on Interactive Ray Tracing 2006, 71--80.
 
41
Havran, V. 2000. Heuristic Ray Shooting Algorithms. Ph.d. thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague.
 
42
Heyer, M., Pfützer, S., and Brüderlin, B. 2005. Visualization Server for Very Large Virual Reality Scenes. In 4. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung.
 
43
 
44
 
45
Hunt, W., Mark, W. R., and Stoll, G. 2006. Fast kd-tree construction with an adaptive error-bounded heuristic. In 2006 IEEE Symposium on Interactive Ray Tracing, IEEE.
 
46
 
47
 
48
Jeschke, S., Wimmer, M., and Schumann, H. 2002. Layered environment-map impostors for arbitrary scenes. In Graphics Interface, 1--8.
 
49
 
50
51
 
52
Lauterbach, C., Yoon, S.-E., Tuft, D., and Manocha, D. 2006. Rt-deform: Interactive ray tracing of dynamic scenes using bvhs. In Proceedings of IEEE Symposium on Interactive Ray Tracing 2006.
 
53
Lauterbach, C., Yoon, S.-E., and Manocha, D. 2007. Raystrips: A compact mesh representation for interactive ray tracing. In IEEE/EG Symposium on Interactive Ray Tracing, 19--26.
54
55
56
57
 
58
 
59
60
 
61
Mora, F., Aveneau, L., and Mériaux, M. 2005. Coherent and exact polygon-to-polygon visibility. In Proc. WSCG, 87--94.
 
62
Nirenstein, S., and Blake, E. 2004. Hardware accelerated visibility preprocessing using adaptive sampling. In Rendering Techniques 2004: 15th Eurographics Workshop on Rendering, 207--216.
 
63
 
64
 
65
66
 
67
Popov, S., Günther, J., Seidel, H.-P., and Slusallek, P. 2006. Experiences with streaming construction of SAH KD-trees. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, 89--94.
 
68
Prince, C. 2000. Progressive Meshes for Large Models of Arbitrary Topology. Master's thesis, Department of Computer Science and Engineering, University of Washington, Seattle.
69
 
70
 
71
 
72
 
73
Sagan, H. 1994. Space-Filling Curves. Springer-Verlag.
 
74
 
75
76
 
77
Shevtsov, Maxim, Soupikov, Alexei, Kapustin, and Alexander. 2007. Highly parallel fast kd-tree construction for interactive ray tracing of dynamic scenes. Computer Graphics Forum 26, 3 (September), 395--404.
 
78
Sigg, C., Weyrich, T., Botsch, M., and Gross, M. 2006. Gpu-based ray-casting of quadratic surfaces. In Symposium on Point - Based Graphics 2006, 59--66.
 
79
Sillion, F., Drettakis, G., and Bodelet, B. 1997. Efficient Impostor Manipulation for Real-Time Visualization of Urban Scenery. In Computer Graphics Forum (Proceedings of Eurographics), 207--218.
 
80
 
81
82
 
83
Van Emde Boas, P. 1977. Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett..
 
84
Wächter, C., and Keller, A. 2006. Instant ray tracing: The bounding interval hierarchy. In Proceedings of the Eurographics Symposium on Rendering, 139--149.
 
85
Wald, I., and Havran, V. 18--20. On building fast kd-trees for ray tracing, and on doing that in o(n log n). In Proceedings of IEEE Symposium on Interactive Ray Tracing 2006, 61--69.
 
86
Wald, L., Slusallek, P., Benthin, C., and Wagner, M. 2001. Interactive rendering with coherent ray tracing. Computer Graphics Forum 20, 3, 153--164.
87
 
88
Wald, I. 2007. On fast construction of sah based bounding volume hierarchies. In Proceedings of the 2007 Eurographics/IEEE Symposium on Interactive Ray Tracing.
89
90
 
91
Wang, X., Tong, X., Lin, S., Hu, S., Guo, B., and Shum, H.-Y. 2004. Generalized displacement maps. In Proceedings of the 2004 Eurographics Symposium on Rendering, Eurographics Association, D. Fellner and S. Spencer, Eds., 227--234.
92
93
 
94
Wimmer, M., Wonka, P., and Sillion, F., 2001. Point-based impostors for real-time visualization, May 29.
 
95
96
97
 
98
Wu, J., and Kobbelt, L. 2003. A stream algorithm for the decimation of massive meshes. In Proc. Graphics Interface, 185--192.
 
99
 
100
 
101
Yoon, S.-E., and Manocha, D. 2006. Cache-efficient layouts of bounding volume hierarchies. Computer Graphics Forum (Eurographics) 25, 507--516.
 
102
103
 
104
Yoon, S.-E., Lauterbach, C., and Manocha, D. 2006. RLODs: Fast LOD-Based Ray Tracing of Massive Models. The Visual Computer 22, 9--11, 772--784.
 
105
Yoon, S., Curtis, S., and Manocha, D. 2007. Ray tracing dynamic scenes using selective restructuring. Proc. of Eurographics Symposium on Rendering.

Collaborative Colleagues:
Enrico Gobbetti: colleagues
Dave Kasik: colleagues
Sung-eui Yoon: colleagues