Abstract
In view of low rendering performance of complex data set which is caused by the limited memory bandwidth and data access speed, this paper presents a mesh layout algorithm based on greedy optimization strategy, by rearranging triangle sequences to improve spatial and temporal locality. Firstly, according to the improved cost function, we choose the vertex with the minimum cost as the focus vertex. Then render its all adjacent unrendered triangles by pushing their bounding vertices into buffer. The above steps are executed iteratively until adjacent triangles of all vertices are rendered. Finally, we get the reordered triangle sequence. Experimental results show that the algorithm provides a higher vertex cache hit ratio with less running time, which can effectively solve the problem of data access speed lagging behind the processing speed of GPU seriously.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hoppe, H.: Optimization of mesh locality for transparent vertex caching. In: Proceeding of SIGGRAPH 1999, pp. 269–276. ACM, New York (1999)
Dai, X., Xiong, H., Gong, J.: Automatic merging method of texture in a 3D city model. J. Wuhan Univ.: Inf. Sci. Ed. 40(3), 347–352 (2015)
Chen, S., Shi, G., Wang, Q.: Data optimization for 3D model rendering by triangle strip deriving. J. Comput.-Aided Des. Comput. Graph. 21(8), 1155–1163 (2009)
Yoon, S.-E., Lindstrom, P.: Mesh layouts for block-based caches. IEEE Trans. Vis. Comput. Graph. 12(5), 1213–1220 (2006)
Qin, A., Shi, J.: Cache-friendly triangle strip generation based on hybrid model. J. Comput.-Aided Des. Comput. Graph. 23(6), 1006–1012 (2011)
Bogomjakov, A., Gotsman, C.: Universal rendering sequences for transparent vertex caching of progressive meshes. Comput. Graph. Forum 21(2), 137–148 (2002)
Karypist, G., Kumart, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96–120 (1998)
Lin, G., Lindstrom, P.: An improved vertex caching scheme for 3D mesh rendering. IEEE Trans. Vis. Comput. Graph. 12(4), 640–648 (2006)
Sander, P., Nehab, D., Barczak, J.: Fast triangle reordering for vertex locality and reduced overdraw. In: Proceedings of SIGGRAPH 2007, pp. 89–98. ACM, New York (2007)
Nehab, D., Barczak, J., Sander, P.: Triangle order optimization for graphics hardware computation culling. In: Proceedings of ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, pp. 207–211. ACM, New York (2006)
Xiong, H.: Research of Rendering Acceleration Techniques for Parallel Environments, pp. 71–80. Zhejiang University, Hangzhou (2008)
Shi, J.: Distributed Parallel Graphics Rendering Techniques and Its Application, pp. 189–274. Science Press, Beijing (2010)
Acknowledgments
This work was supported by Key Laboratory of Educational Informatization for Nationalities Ministry of Education, Yunnan Normal University and the National Natural Science Funds (61262070, 61462097).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Lou, Z., Zhang, Y. (2016). Research of Mesh Layout Algorithm Based on Greedy Optimization Strategy. In: El Rhalibi, A., Tian, F., Pan, Z., Liu, B. (eds) E-Learning and Games. Edutainment 2016. Lecture Notes in Computer Science(), vol 9654. Springer, Cham. https://doi.org/10.1007/978-3-319-40259-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-40259-8_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40258-1
Online ISBN: 978-3-319-40259-8
eBook Packages: Computer ScienceComputer Science (R0)