Skip to main content
SpringerLink
Log in

Evaluation of triangular mesh layout techniques using large mesh simplification

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Highly detailed polygonal meshes nowadays were created vastly from a great number of multimedia applications. Insufficient main memory space and inferior locality-of-reference nature of the input mesh sequence incurred frequent page swaps and extremely low runtime efficiency. To address this issue, techniques based on the models of graph layout, matrix bandwidth minimization, and space-filling-curves were reported. However, such models merely considered the optimization of vertex layout on the basis of the graph distance or matrix bandwidths while leave the optimization of face layout either unoptimized or resorted an additional sorting procedure. In this paper, we propose an improved theoretic model suggesting the optimization of index-faced triangular mesh layout on the basis of a jointly consideration on both the vertex and face layout. Unlike previous attempts, we do not need additional efforts in optimizing one layout after the other by sorting, the optimized layouts are generated on the fly with each other with respect to both the vertex or triangle bandwidths. According to the experimental results, our approach outperforms the CM and SFC methods not only at yielding better theoretical results but also at improving the runtime efficiency of large mesh simplification.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20

Similar content being viewed by others

References

  1. Ahn M, Guskov I, Lee S (2006) Out-of-core remeshing of large polygonal meshes. IEEE Trans Vis Comput Graph 12(5):1221–1228. doi:10.1109/TVCG.2006.169

    Article  Google Scholar 

  2. Bar-Yehuda R, Gotsman C (1996) Time/space tradeoffs for polygon mesh rendering. ACM Trans Graph 15(2):141–152. doi:10.1145/234972.234976

    Article  Google Scholar 

  3. Bender MA, Kuszmaul BC, Teng SH, Wang K (2011) Optimal cache-oblivious mesh layouts. Theory Comput Syst 48(2):269–296. doi:10.1007/s00224-009-9242-2

    Article  MathSciNet  MATH  Google Scholar 

  4. Bogomjakov A, Gotsman C (2002) Universal rendering sequences for transparent vertex caching of progressive meshes. Comput Graph Forum 21(2):137–149. doi:10.1111/1467-8659.00573

    Article  Google Scholar 

  5. Bolitho M, Kazhdan M, Burns R, Hoppe H (2007) Multilevel streaming for out-of-core surface reconstruction Proceedings of the 5th eurographics symposium on geometry processing, SGP’07. http://dl.acm.org/citation.cfm?id=1281991.1282001. Eurographics Association, Aire-la-Ville, Switzerland, pp 69–78

    Google Scholar 

  6. Brodal GS (2004) Cache-oblivious algorithms and data structures. In: Hagerup T, Katajainen J (eds) Proceedings of the algorithm theory - SWAT 2004: 9th Scandinavian workshop on algorithm theory, Humlebæk, Denmark. Springer, Berlin Heidelberg, pp 3–13. DOI 10.1007/978-3-540-27810-8_2, (to appear in print)

  7. Cabiddu D, Attene M (2015) Large mesh simplification for distributed environments. Comput Graph 51:81–89. doi:10.1016/j.cag.2015.05.015. International Conference Shape Modeling International

    Article  Google Scholar 

  8. Chen HK, Fahn CS, Lin MB (2007) The storage independent polygonal mesh simplification system Proceedings of the 2nd international conference on virtual reality, ICVR’07. http://dl.acm.org/citation.cfm?id=1770090.1770092. Springer-Verlag, Berlin, Heidelberg, pp 3–12

    Google Scholar 

  9. Chen HK, Fahn CS, Tsai JJ, Lin MB (2006) A novel cache-based approach to large polygonal mesh simplification. J Inf Sci Eng 22(4):843–861

    Google Scholar 

  10. Chow MM (1997) Optimized geometry compression for real-time rendering Proceedings of the 8th conference on visualization ’97, VIS’97. http://dl.acm.org/citation.cfm?id=266989.267103. IEEE Computer Society Press, NY, USA, p 347

    Google Scholar 

  11. Cignoni P, Montani C, Rocchini C, Scopigno R (2003) External memory management and simplification of huge meshes. IEEE Trans Vis Comput Graph 9 (4):525–537. doi:10.1109/TVCG.2003.1260746

    Article  Google Scholar 

  12. Cuthill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices Proceedings of the 1969 24th national conference, ACM ’69. doi:10.1145/800195.805928. ACM, NY, USA, pp 157–172

    Chapter  Google Scholar 

  13. Deering M (1995) Geometry compression Proceedings of the 22nd annual conference on computer graphics and interactive techniques, SIGGRAPH ’95. doi:10.1145/218380.218391. ACM, USA, pp 13–20

    Chapter  Google Scholar 

  14. Demaine ED (2002) Cache-oblivious algorithms and data structures. Lect Notes EEF Summer Sch Massive Data Sets 8(4):1–249

    Google Scholar 

  15. Derzapf E, Menzel N, Guthe M (2010) Parallel view-dependent out-of-core progressive meshes. Realismus der Echtzeitgrafik:61

  16. Díaz J., Petit J, Serna M (2002) A survey of graph layout problems. ACM Comput Surv 34(3):313–356. doi:10.1145/568522.568523

    Article  Google Scholar 

  17. Esposito A, Catalano MSF, Malucelli F, Tarricone L (1998) A new matrix bandwidth reduction algorithm. Oper Res Lett 23(3-5):99–107. doi:10.1016/S0167-6377(98)00040-6

    Article  MathSciNet  MATH  Google Scholar 

  18. Farias R, Silva CT (2001) Out-of-core rendering of large, unstructured grids. IEEE Comput Graph Appl 21(4):42–50

    Article  Google Scholar 

  19. Frigo M, Leiserson CE, Prokop H, Ramachandran S (2012) Cache-oblivious algorithms. ACM Trans Algorithm (TALG) 8(1):4

    MathSciNet  MATH  Google Scholar 

  20. Garland M, Heckbert PS (1997) Surface simplification using quadric error metrics Proceedings of the 24th annual conference on computer graphics and interactive techniques, SIGGRAPH ’97. doi:10.1145/258734.258849. ACM Press/Addison-Wesley Publishing Co., NY, USA, pp 209–216

    Chapter  Google Scholar 

  21. Gibbs NE, William G, Poole J, Stockmeyer PK (1976) An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J Numer Anal 13 (2):236–250. doi:10.1137/0713023

    Article  MathSciNet  MATH  Google Scholar 

  22. Hoppe H (1998) Smooth view-dependent level-of-detail control and its application to terrain rendering Proceedings of the visualization’98. IEEE, pp 35–42

  23. Hoppe H (1999) Optimization of mesh locality for transparent vertex caching Proceedings of the 26th annual conference on computer graphics and interactive techniques, SIGGRAPH ’99. doi:10.1145/311535.311565. ACM Press/Addison-Wesley Publishing Co., NY, USA, pp 269–276

    Chapter  Google Scholar 

  24. Isenburg M, Gumhold S (2003) Out-of-core compression for gigantic polygon meshes. ACM Trans Graph 22(3):935–942. doi:10.1145/882262.882366

    Article  Google Scholar 

  25. Isenburg M, Lindstrom P (2005) Streaming meshes visualization, 2005. VIS 05. doi:10.1109/VISUAL.2005.1532800. IEEE, pp 231–238

  26. Isenburg M, Lindstrom P, Gumhold S, Snoeyink J (2003) Large mesh simplification using processing sequences Proceedings of the 14th IEEE Visualization 2003 (VIS’03), VIS ’03. doi:10.1109/VISUAL.2003.1250408. IEEE Computer Society, DC, USA, p 61

    Google Scholar 

  27. Isenburg M, Lindstrom P, Snoeyink J (2005) Streaming compression of triangle meshes ACM SIGGRAPH 2005 Sketches. ACM, p 136

  28. Koller D, Trimble J, Najbjerg T, Gelfand N, Levoy M (2006) Fragments of the city: Stanford’s digital forma urbis romae project. J Roman Archaeol Suppl Ser 19(61):237–252

  29. Li L, Schemenauer N, Peng X, Zeng Y, Gu P (2002) A reverse engineering system for rapid manufacturing of complex objects. Rob Comput Integr Manuf 18 (1):53–67. doi:10.1016/S0736-5845(01)00026-6

    Article  Google Scholar 

  30. Lillesand T, Kiefer RW, Chipman J (2014) Remote sensing and image interpretation. Wiley

  31. Lin G, Yu TPY (2006) An improved vertex caching scheme for 3d mesh rendering. IEEE Trans Vis Comput Graph 12(4):640–648. doi:10.1109/TVCG.2006.59

    Article  MathSciNet  Google Scholar 

  32. Lindstrom P (2000) Out-of-core simplification of large polygonal models Proceedings of the 27th annual conference on computer graphics and interactive techniques. ACM Press, Addison-Wesley Publishing Co, pp 259–262

    Google Scholar 

  33. Lindstrom P, Pascucci V (2001) Visualization of large terrains made easy Proceedings of the conference on visualization ’01, VIS’01. http://dl.acm.org/citation.cfm?id=601671.601729. IEEE Computer Society, DC, USA, pp 363–371

    Google Scholar 

  34. Lindstrom P, Pascucci V (2002) Terrain simplification simplified: a general framework for view-dependent out-of-core visualization. IEEE Trans Vis Comput Graph 8(3):239–254

    Article  Google Scholar 

  35. Liu R, Zhang H, van Kaick O (2006) Spectral sequencing based on graph distance Proceedings of the 4th international conference on geometric modeling and processing, GMP’06. Springer-Verlag, Berlin, Heidelberg, pp 630–636. DOI 10.1007/11802914_50, (to appear in print)

  36. Miller GL, Teng SH, Thurston W, Vavasis SA (1998) Geometric separators for finite-element meshes. SIAM J Sci Comput 19(2):364–386. doi:10.1137/S1064827594262613

    Article  MathSciNet  MATH  Google Scholar 

  37. Park JS, Chung MS, Hwang SB, Shin BS, Park HS (2006) Visible Korean human: its techniques and applications. Clin Anat 19(3):216–224

    Article  Google Scholar 

  38. Pascucci V, Frank RJ (2001) Global static indexing for real-time exploration of very large regular grids Proceedings of the 2001 ACM/IEEE conference on supercomputing, SC ’01. ACM, NY, USA, p 2, DOI 10.1145/582034.582036, (to appear in print)

  39. Petit J (2013) Addenda to the survey of layout problems. Bullet EATCS 3(105)

  40. Sagan H (1994) Space-filling curves. Universitext. Springer, New York. http://cds.cern.ch/record/1609380

    Book  MATH  Google Scholar 

  41. Sajadi B, Jiang S, Gopi M, Heo JP, Yoon SE (2011) Data management for ssds for large-scale interactive graphics applications Symposium on interactive 3D graphics and games, I3D ’11. ACM, NY, USA, pp 175–182. DOI 10.1145/1944745.1944775, (to appear in print)

  42. Sander PV, Nehab D, Chlamtac E, Hoppe H (2008) Efficient traversal of mesh edges using adjacency primitives ACM SIGGRAPH Asia 2008 Papers, SIGGRAPH Asia ’08. doi:10.1145/1457515.1409097. ACM, NY, USA, pp 144:1–144:9

    Google Scholar 

  43. Spitzer V, Ackerman MJ, Scherzinger AL, Whitlock D (1996) The visible human male: a technical report. J Am Med Inform Assoc 3(2):118–130

    Article  Google Scholar 

  44. Spitzer VM (2015) The visible human: A graphical interface for holistic modeling and simulation. The Digital Patient: Advancing Healthcare, Research, and Education p 51

  45. Stanco F, Battiato S, Gallo G (2011) Digital imaging for cultural heritage preservation: Analysis, Restoration, and reconstruction of ancient artworks, 1st edn. CRC Press, Inc., FL, USA

    Google Scholar 

  46. Tchiboukdjian M, Danjean V, Raffin B (2010) Binary mesh partitioning for cache-efficient visualization. IEEE Trans Vis Comput Graph 16(5):815–828. doi:10.1109/TVCG.2010.19

    Article  Google Scholar 

  47. Varadhan G, Manocha D (2002) Out-of-core rendering of massive geometric environments Visualization, 2002. VIS 2002. IEEE, pp 69–76

  48. Vo HT, Silva CT, Scheidegger LF, Pascucci V (2012) Simple and efficient mesh layout with space-filling curves. J Graph Tools 16(1):25–39. doi:10.1080/2151237X.2012.641828

    Article  Google Scholar 

  49. Wang C, Xu C, Lisser A (2014) Bandwidth minimization problem MOSIM 2014, 10ème conférence francophone de modélisation, optimisation et simulation. https://hal.archives-ouvertes.fr/hal-01166658 Colloque avec actes et comité de lecture. Internationale, Nancy, France

  50. Wu J, Kobbelt L (2003) A stream algorithm for the decimation of massive meshes. In: Graphics interface, vol 3, pp 185–192

  51. Yoon SE, Lindstrom P (2006) Mesh layouts for block-based caches. IEEE Trans Vis Comput Graph 12(5):1213–1220. doi:10.1109/TVCG.2006.162

    Article  Google Scholar 

  52. Yoon SE, Lindstrom P, Pascucci V, Manocha D (2005) Cache-oblivious mesh layouts. ACM Trans Graph 24(3):886–893. doi:10.1145/1073204.1073278

    Article  Google Scholar 

  53. Yotov K, Roeder T, Pingali K, Gunnels J, Gustavson F (2007) An experimental comparison of cache-oblivious and cache-conscious programs Proceedings of the 19th annual ACM symposium on parallel algorithms and architectures. ACM, pp 93–104

  54. Zhang S, Jie B, Tan L (2013) The application of chinese visible human dataset. FASEB J 27(1 Supplement):lb8–lb8

    Google Scholar 

  55. Zhang SX, Heng PA, Liu ZJ (2006) Chinese visible human project. Clin Anat 19(3):204–215

    Article  Google Scholar 

Download references

Acknowledgments

We would like to thank the 3D Scanning Repository and the Digital Michelangelo Project Archive of 3D Models for providing us all the test models. We also give our gratitude to Huy T. Vo et al. for sharing their codes in the public domain so we can have a comparison with their works.

Author information

Authors and Affiliations

  1. Electronic Engineering Department, National Chin-Yi University of Technology, Taichung, 40109, Taiwan

    Hung-Kuang Chen

Authors
  1. Hung-Kuang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hung-Kuang Chen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, HK. Evaluation of triangular mesh layout techniques using large mesh simplification. Multimed Tools Appl 76, 25391–25419 (2017). https://doi.org/10.1007/s11042-017-4607-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-017-4607-z

Keywords

Search

Navigation