AI helps you reading Science
AI generates interpretation videos
AI extracts and analyses the key points of the paper to generate videos automatically
AI parses the academic lineage of this thesis
AI extracts a summary of this paper
We have presented an efficient technique for end-to-end out-of-core construction and view-dependent visualization of very large surface models on commodity graphics platforms
Coz: finding code that counts with causal profiling.
Commun. ACM, no. 6 (2018): 91-99
Improving performance is a central concern for software developers. To locate optimization opportunities, developers rely on software profilers. However, these profilers only report where programs spent their time: optimizing that code may have no impact on performance. Past profilers thus both waste developer time and make it difficult f...More
PPT (Upload PPT)
- The authors describe an efficient technique for out-of-core construction and accurate view-dependent visualization of very large surface models.
- The representation is constructed during a fine-to-coarse simplification of the surface contained in diamonds.
- Appropriate boundary constraints are introduced in the simplification to ensure that all conforming selective subdivisions of the tetrahedron hierarchy lead to correctly matching surface patches.
- For each frame at runtime, the hierarchy is traversed coarse-to-fine to select diamonds of the appropriate resolution given the view parameters.
- The resulting system can interatively render high quality views of out-of-core models of hundreds of millions of triangles at over 40Hz on current commodity graphics platforms
- We describe an efficient technique for out-of-core construction and accurate view-dependent visualization of very large surface models
- We have presented an efficient technique for end-to-end out-of-core construction and view-dependent visualization of very large surface models on commodity graphics platforms
- An experimental software library and a rendering application supporting the technique have been implemented on Linux using C++ with OpenGL and the MPICH MPI implementation.
- The authors' speed is currently slower
- This is mainly because the authors generate a full multiresolution structure, as opposed to a single small model, and simplification is only a single step of diamond processing, that includes cache-coherent stripification, mesh compression, and optimal bound computation, each costing as much as simplification.
- Not included in the table is the maximum resident memory usage of the method, which is low and constant for workers (26 MB each) and variable for the master process, due to the in-core graph layout data structure and to disk buffer caches used by the operating system
- The authors have presented an efficient technique for end-to-end out-of-core construction and view-dependent visualization of very large surface models on commodity graphics platforms.
- The proposed solution consists in an innovative combination of volumetric subdivision, mesh compression and simplification, out-of-core data management, and batched rendering techniques, resulting in an unprecedented spatiotemporal quality in the interactive rendering of massive models.
- The authors plan to explore more aggressive and lossy compression techniques and to investigate error metrics taking into account the effect of simplification on the shading of the surface.
- Given the performance of the method, the authors are confident that multi-pass or vertex/fragment program techniques will become readily applicable to gigantic datasets
- Table1: Numerical results for out-of-core construction. Tests performed on a network of PCs. All times are in seconds
- Rapidly rendering adaptive representations of large models is a very active research area. In the following, we will discuss the approaches that are most closely related with our work. Readers may refer to recent surveys (e.g., [Chiang et al 2003]) for further details.
Out-of-core mesh simplification. Various techniques have been presented to face the problem of huge mesh simplification. With the exception of memoryless clustering approaches [Lindstrom 2000; Lindstrom 2003] and stream-based methods [Wu and Kobbelt 2003; Isenburg et al 2003], most of these techniques, such as Hoppe’s hierarchical method for digital terrain management  and the octree based structure OEMM [Cignoni et al 2003a], are based on some kind of mesh partitioning and subsequent independent simplification. Hoppe hierarchically divides the mesh in blocks, simplifies each block while freezing borders and then traverses the block hierarchy bottom-up by merging sibling cells and again simplifying. In this approach some of the borders remain unchanged until the very last simplification step. OEMM avoids this kind of problem, but it does not build a multiresolution structure. On the other hand, BDAM [Cignoni et al 2003c] allows both the independent processing of small sub-portions of the whole mesh and the construction of a multiresolution structure, but is limited to height fields. Our work generalizes this approach to arbitrary surfaces, and parallelizes the simplification process in order to efficiently build a multiresolution structure for very large meshes.
- This research is partially supported by the VPLANET project (EU RTD contract IST-2000-28095)
- BOTSCH, M., AND KOBBELT, L. 2003. High-quality point-based rendering on modern GPUs. In Proc. Pacific Graphics, 335–343.
- CHIANG, Y.-J., GOODRICH, M. T., GROVE, E. F., TAMASSIA, R., VENGROFF, D. E., AND VITTER, J. S. 1995. Externalmemory graph algorithms. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 139–149.
- CHIANG, Y.-J., EL-SANA, J., LINDSTROM, P., PAJAROLA, R., AND SILVA, C. T. 200Out-of-core algorithms for scientific visualization and computer graphics. IEEE Visualization 2003, Tutorial 4 Course Notes.
- CIGNONI, P., MONTANI, C., ROCCHINI, C., AND SCOPIGNO, R. 2003. External memory management and simplification of huge meshes. IEEE Transactions on Visualization and Computer Graphics 9, 525–337.
- CIGNONI, P., DE FLORIANI, L., PASCUCCI, V., ROSSIGNAC, J., AND SILVA, C. T. 2003. Multiresolution modeling, visualization, and compression of volumetric data. IEEE Visualization 2003, Tutorial 3 Course Notes.
- 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, 505–514.
- COHEN-OR, D., AND LEVANONI, Y. 1996. Temporal continuity of levels of detail in delaunay triangulated terrain. In IEEE Visualization ’96, IEEE.
- DACHSBACHER, C., VOGELSGANG, C., AND STAMMINGER, M. 2003. Sequential point trees. In Proc. SIGGRAPH, 657–662.
- DUCHAINEAU, M., WOLINSKY, M., SIGETI, D., MILLER, M., ALDRICH, C., AND MINEEV-WEINSTEIN, M. 1997. ROAMing terrain: Real-time optimally adapting meshes. In Proceedings IEEE Visualization ’97, IEEE, 81–88.
- EL-SANA, J., AND CHIANG, Y.-J. 2000. External memory view-dependent simplification. Computer Graphics Forum 19, 3 (Aug.), 139–150.
- EL-SANA, J., AND VARSHNEY, A. 1999. Generalized viewdependent simplification. Computer Graphics Forum 18, 3, 83– 94.
- ERIKSON, C., MANOCHA, D., AND BAXTER, W. 2001. HLODs for faster display of large static and dynamic environments. In Proc. ACM Symposium on Interactive 3D Graphics, 111–120.
- FISCHER, K., AND GA RTNER, B. 2003. The smallest enclosing ball of balls: combinatorial structure and algorithms. In Proceedings of the nineteenth conference on Computational geometry, ACM Press, 292–301.
- GREGORSKI, B., DUCHAINEAU, M., LINDSTROM, P., PASCUCCI, V., AND JOY, K. I. 2002. Interactive view-dependent rendering of large IsoSurfaces. In Proc. IEEE Visualization, 475–484.
- HOPPE, H. 1997. View-dependent refinement of progressive meshes. In SIGGRAPH 97 Conference Proceedings, Addison Wesley, T. Whitted, Ed., Annual Conference Series, ACM SIGGRAPH, 189–198. ISBN 0-89791-896-7.
- HOPPE, H. 1998. Smooth view-dependent level-of-detail control and its aplications to terrain rendering. In IEEE Visualization ’98 Conf., 35–42.
- HOPPE, H. 1999. New quadric metric for simplifying meshes with appearance attributes. In Proceedings of the 10th Annual IEEE Conference on Visualization (VIS-99), ACM Press, New York, pages 59–66.
- ISENBURG, M., LINDSTROM, P., GUMHOLD, S., AND J.SNOEYINK. 2003. Large mesh simplification using processing sequences. In Proc. IEEE Visualization.
- ISENBURG, M. 2001. Triangle strip compression. Computer Graphics Forum 20, 2, 91–101.
- LEVENBERG, J. 2002. Fast view-dependent level-of-detail rendering using cached geometry. In Proceedings IEEE Visualization ’02, IEEE, 259–266.
- LINDSTROM, P., AND PASCUCCI, V. 2002. Terrain simplification simplified: A general framework for view-dependent out-of-core visualization. IEEE Transaction on Visualization and Computer Graphics 8, 3, 239–254.
- LINDSTROM, P. 2000. Out-of-core simplification of large polygonal models. In Comp. Graph. Proc., Annual Conf. Series (SIGGRAPH 2000), ACM Press, Addison Wesley, 259–262.
- LINDSTROM, P. 2003. Out-of-core construction and visualization of multiresolution surfaces. In ACM 2003 Symposium on Interactive 3D Graphics, 93–102,239.
- LUEBKE, D., AND ERIKSON, C. 1997. View-dependent simplification of arbitrary polygonal environments. In ACM Computer Graphics Proc., Annual Conference Series, (SIGGRAPH 97), 199–208.
- MAUBACH, J. 1995. Local bisection refinement for n-simplicial grids generated by bisection. SIAM Journal of Scientific Computing 16, 210–227.
- OHLBERGER, M., AND RUMPF, M. 1998. Adaptive projection operators in multiresolution scientific visualization. IEEE Transactions on Visualization and Computer Graphics 4, 4, 344–364.
- PASCUCCI, V. 2002. Slow growing subdivision (SGS) in any dimension: Towards removing the curse of dimensionality. Computer Graphics Forum 21, 3, 451–460.
- POMERANZ, A. A. 2000. ROAM Using Surface Triangle Clusters (RUSTiC). Master’s thesis, University of California at Davis.
- PRINCE, C. 2000. Progressive Meshes for Large Models of Arbitrary Topology. Master’s thesis, Department of Computer Science and Engineering, University of Washington, Seattle.
- RUSINKIEWICZ, S., AND LEVOY, M. 2000. QSplat: A multiresolution point rendering system for large meshes. In Comp. Graph. Proc., Annual Conf. Series (SIGGRAPH 00), ACM Press, 343– 352.
- SAMET, H. 1990. Applications of Spatial Data Structures. Addison Wesley, Reading, MA.
- SHAFFER, E., AND GARLAND, M. 2001. Efficient adaptive simplification of massive meshes. In Proc. IEEE Visualization 2001, IEEE Press, 127–134.
- WU, J., AND KOBBELT, L. 2003. A stream algorithm for the decimation of massive meshes. In Proc. Graphics Interface, 185– 192.
- XIA, J., AND VARSHNEY, A. 1996. Dynamic view-dependent simplification for polygonal models. In IEEE Visualization ‘96 Proc., R. Yagel and G. Nielson, Eds., 327–334.