Fast triangle reordering for vertex locality and reduced overdraw

Proceedings of the ACM SIGGRAPH Conference on Computer Graphics

Volumn , Issue , 2007, Pages

  Sander, Pedro V ^a   Nehab, Diego ^b   Barczak, Joshua ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b PRINCETON UNIVERSITY   (United States)

^c AMD

Author keywords

[No Author keywords available]

Indexed keywords

TRANSFORM VERTEX; VERTEX LOCALITY; APPLICATIONS.; CAD/CAMS; FAST TRIANGLE REORDERING; IN PROCESSING; NEW RESULTS; NOVEL ALGORITHMS; VERTEX CACHES;

COMPUTER AIDED DESIGN; COMPUTER AIDED MANUFACTURING; GEOMETRY; MATHEMATICAL MODELS; OPTIMIZATION; TOPOLOGY; COMPUTER GRAPHICS; DRUG PRODUCTS PLANTS; INTERACTIVE COMPUTER GRAPHICS; TRIANGULATION;

ALGORITHMS; COMPUTATIONAL GEOMETRY;

EID: 57149087712     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1275808.1276489     Document Type: Conference Paper

References (40)

1. AIREY, J. M. 1990. Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations. PhD thesis, UNC-CH.
2. AKELEY, K., HAEBERLI, P., and BURNS, D. 1990. The tomesh.c program. Available on SGI computers and developers toolbox CD.
3. ARKIN, E. M., HELD, M., MITCHELL, J. S. B., and SKLENA, S. 1996. Hamiltonian triangulations for fast rendering. The Visual Computer, 12(9):429-444.
4. BAR-YEHUDA, R. and GOTSMAN, C. 1996. Time/space tradeoffs for polygon mesh rendering. ACM Transactions on Graphics, 15 (2): 141-152.
5. BELMONTE, O., REMOLAR, I., J. RIBELLES, M. C., REBOLLO, C., and FERNÁNDEZ, M. 2001. Multiresolution triangle strips. In Proceedings of IASTED VIIP, pages 182-187.
6. BITTNER, J., WIMMER, M., and HARALD PIRINGER, W. P. 2004. Coherent hierarchical culling: Hardware occlusion queries made useful. Computer Graphics Forum, 23(3):615-624.
7. BLYTHE, D. 2006. The Direct3D 10 system. ACM Transactions on Graphics (Proc of ACM SIGGRAPH 2003), 25(3):724-734.
8. BOGOMJAKOV, A. and GOTSMAN, C. 2002. Universal rendering sequences for transparent vertex caching of progressive meshes. Computer Graphics Forum, 21(2): 137-148.
9. CHOW, M. M. 1997. Optimized geometry compression for real-time rendering. In Visualization'97, pages 347-354, 559.
10. DEERING, M. 1995. Geometry compression. In Proc. of ACM SIGGRAPH 95, pages 13-20.
11. DEERING, M. F. and NELSON, S. R. 1993. Leo: a system for cost effective 3D shaded graphics. In Proc of ACM SIGGRAPH 93, pages 101-108.
12. DIAZ-GUTIERREZ, P., BHUSHAN, A., GOPI, M., and PAJAROLA, R. 2006. Single-strips for fast interactive rendering. The Visual Computer, 22(6):372-386.
13. DILLENCOURT, M. B. 1996. Finding hamiltonian cycles in delaunay triangulations is NP-complete. Discrete Applied Mathematics, 64(3):207-217.
14. EL-SANA, J. A., AZANLI, E., and VARSHNEY, A. 1999. Skip strips: maintaining triangle strips for view-dependent rendering. In Visualization '99, pages 131-138.
15. ESTKOWSKI, R., MITCHELL, J., and XI-A NG., X. 2002. Optimal decomposition of polygonal models into triangle strips. In SCG, pages 254-263.
16. EVANS, F., SKIENA, S., and VARSHNEY, A. 1996. Optimizing triangle strips for fast rendering. In Visualization '96, pages 319-326.
17. GAREY, M. R., JOHNSON, D. S., and TARJAN, R. E. 1976. The planar hamiltonian circuit problem is NP-complete. SIAM J. Comput., 5(4):704-714.
18. GOPI, M. 2004. Controllable single-strip generation for triangulated surfaces. In PG '04, pages 61-69.
19. GOVINDARAJU, N. K., HENSON, M., LIN, M. C., and MANOCHA, D. 2005. Interactive visibility ordering and transparency computations among geometric primitives in complex environments. In I3D, pages 49-56.
20. GREENE, N., KASS, M., and MILLER, G. 1993. Hierarchical z-buffer visibility. In Proc. of ACM SIGGRAPH 93, pages 231-238.
21. GUMHOLD, S. and STRASSER, W. 1998. Real time compression of triangle mesh connectivity. In Proc. of ACM SIGGRAPH 98, pages 133-140.
22. HILLESLAND, K., A., B. S., D., L., and MANOCHA. 2002. Fast and simple occlusion culling using hardware-based depth queries. Technical Report TR02-039, Department of Computer Science, UNC-CH.
23. HOPPE, H. 1999. Optimization of mesh locality for transparent vertex caching. In Proc of ACM SIGGRAPH 99, pages 269-276.
24. LIN, G. and YU, T. P.-Y. 2006. An improved vertex caching scheme for 3d mesh rendering. TVCG, 12(4):640-648.
25. MITRA, T. and CHIUEH, T. 1998. A breadth-first approach to efficient mesh traversal. In HWWS'98, pages 31-38.
26. NEHAB, D., BARCZAK, J., and SANDER, P. V. 2006. Triangle order optimization for graphics hardware computation culling. In I3D, pages 207-211.
27. RAMOS, J. and CHOVER, M. 2004. Lodstrips: Level of detail strips. Lecture Notes in Computer Science, 3039:107-114.
28. RIBELLES, J., LÓPEZ, A., REMOLAR, I., BELMONTE, O., and CHOVER, M. 2000. Multiresolution modelling of polygonal surface meshes using triangle fans. Lecture Notes in Computer Science, 1953:431-443.
29. RIPOLLÉS, O., CHOVER, M., and RAMOS, J. F. 2005. Quality strips for models with level of detail. In Proceedings of IASTED VIIP, ACTA Press, pages 268-273.
30. SHAFAE, M. and PAJAROLA, R. 2003. Dstrips: Dynamic triangle strips for real-time mesh simplification and rendering. In PG'03, pages 271-280.
31. SPECKMANN, B. and SNOEYINK, J. 1997. Easy triangle strips for tin terrain models. In Canadian Conference on Computational Geometry, pages 91-100.
32. STEWART, A. J. 2001. Tunneling for triangle strips in continuous level-of-detail meshes. In Graphics Interface, pages 91-100.
33. TAUBIN, G. and. ROSSIGNAC, J. 1998. Geometric compression through topological surgery. ACM Transactions on Graphics, 17 (2):84-115.
34. TELLER, S. J. and SÈQUIN, C. H. 1991. Visibility preprocessing for interactive walkthroughs. In Proc. of ACM SIGGRAPH 91, pages 61-70.
35. TOUMA, C. and GOTSMAN, C. 1998. Triangle mesh compression. In Proceedings of Graphics Interface, pages 26-34.
36. VAN KAICK, O., DA SILVA, M., and PEDRINI, H. 2004. Efficient generation of triangle strips from triangulated meshes. Journal of WSCG, 12(1-3):475-481.
37. VELHO, L., DE FIGUEIREDO, L. H., and GOMES, J. 1999. Hierarchical generalized triangle strips. The Visual Computer, 15(1): 21-35.
38. XIANG, X., HELD, M., and MITCHELL, J. S. B. 1999. Fast and effective stripification of polygonal surface models. In Proceedings of the 1999 Symposium on Interactive 3D Graphics, pages 71-78.
39. YOON, S.-E. and LINDSTROM, P. 2006. Mesh layouts for blockbased caches. TVCG, 12(5):1213-1220.
40. YOON, S.-E., LINDSTROM, P., PASCUCCI, V., and MANOCHA, D. 2005. Cache-oblivious mesh, layouts. ACM Transactions on Graphics (Proc. of ACM SIGGRAPH 2005), 24(3):886-893.