{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T20:57:21Z","timestamp":1761512241412,"version":"3.32.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,5,12]],"date-time":"2006-05-12T00:00:00Z","timestamp":1147392000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Visual Comput"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s00371-006-0018-2","type":"journal-article","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T19:11:33Z","timestamp":1147374693000},"page":"372-386","source":"Crossref","is-referenced-by-count":16,"title":["Single-strips for fast interactive rendering"],"prefix":"10.1007","volume":"22","author":[{"given":"Pablo","family":"Diaz-Gutierrez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anusheel","family":"Bhushan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Gopi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Pajarola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,12]]},"reference":[{"key":"18_CR1","unstructured":"Akeley, K., Haeberli, P., Burns, D.: The tomesh.c program. Tech. Rep. SGI Developer\u2019s Toolbox CD, Silicon Graphics (1990)"},{"issue":"9","key":"18_CR2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF01782475","volume":"12","author":"E.M. Arkin","year":"1996","unstructured":"Arkin, E.M., Held, M., Mitchell, J.S.B., Skiena, S.: Hamiltonian triangulations for fast rendering. Visual Comput. 12(9), 429\u2013444 (1996)","journal-title":"Visual Comput."},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/234972.234976","volume":"15","author":"R. Bar-Yehuda","year":"1996","unstructured":"Bar-Yehuda, R., Gotsman, C.: Time\/space tradeoffs for polygon mesh rendering. ACM Trans. on Graph. 15(2), 141\u2013152 (1996)","journal-title":"ACM Trans. on Graph."},{"key":"18_CR4","unstructured":"Belmonte, O., Remolar, I., Ribelles, J., Chover, M., Rebollo, C., Fernandez, M.: Multiresolution triangle strips. In: IASTED International Conference on Visualization, Imaging and Image Processing (VIIP 2001), pp. 182\u2013187 (2001)"},{"key":"18_CR5","unstructured":"Bogomjakov, A., Gotsman, C.: Universal rendering sequences for transparent vertex caching of progressive meshes. In: Watson, B., Buchanan, J.W. (eds.) Proceedings of Graphics Interface 2001, pp. 81\u201390. Canadian Formation Processing Society (2001). URL citeseer.ist.psu.edu\/bogomjakov01universal.html"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chow, M.M.: Optimized geometry compression for real-time rendering. In: VIS \u201997: Proceedings of the 8th conference on Visualization \u201997, pp. 347\u2013ff. IEEE Computer Society Press, Los Alamitos, CA (1997)","DOI":"10.1109\/VISUAL.1997.663902"},{"issue":"3","key":"18_CR7","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1015706.1015817","volume":"23","author":"D. Cohen-Steiner","year":"2004","unstructured":"Cohen-Steiner, D., Alliez, P., Desbrun, M.: Variational shape approximation. ACM Trans. on Graph. 23(3), 905\u2013914 (2004)","journal-title":"ACM Trans. on Graph."},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1287\/ijoc.11.2.138","volume":"11","author":"W. Cook","year":"1999","unstructured":"Cook, W., Rohe, A.: Computing minimum-weight perfect matchings. INFORMS J. Comput. 11, 138\u2013148 (1999)","journal-title":"INFORMS J. Comput."},{"key":"18_CR9","unstructured":"Deering, M.: Geometry compression. URL citeseer.ifi.unizh.ch\/654211.html"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Diaz-Gutierrez, P., Bhushan, A., Gopi, M., Pajarola, R.: Constrained strip generation and management for efficient interactive 3D rendering. In: Proceedings Computer Graphics International Conference, pp. 115\u2013121. IEEE Computer Society (2005)","DOI":"10.1109\/CGI.2005.1500388"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Diaz-Gutierrez, P., Gopi, M.: Quadrilateral and tetrahedral mesh stripification using 2-factor partitioning of the dual graph. Visual Comput. 21(8\u201310), 689\u2013697 (2005)","DOI":"10.1007\/s00371-005-0336-9"},{"issue":"3","key":"18_CR12","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1111\/j.1467-8659.2005.00871.x","volume":"24","author":"P. Diaz-Gutierrez","year":"2005","unstructured":"Diaz-Gutierrez, P., Gopi, M., Pajarola, R.: Hierarchyless simplification, stripification and compression of triangulated two-manifolds. Comput. Graph. Forum 24(3), 457\u2013467 (2005)","journal-title":"Comput. Graph. Forum"},{"key":"18_CR13","unstructured":"Dillencourt, M.: Finding Hamiltonian cycles in delaunay triangulations is NP-complete. In: Canadian Conference on Computational Geometry (CCCG), pp. 223\u2013228 (1992)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"El-Sana, J.A., Azanli, E., Varshney, A.: Skip strips: Maintaining triangle strips for view-dependent rendering. In: Ebert, D., Gross, M., Hamann, B. (eds.) IEEE Visualization \u201999, pp. 131\u2013138. San Francisco (1999). URL citeseer.ist.psu.edu\/el-sana99skip.html","DOI":"10.1109\/VISUAL.1999.809877"},{"key":"18_CR15","unstructured":"Evans, F., Skiena, S., Varshney, A.: Completing sequential triangulations is hard. Tech. Rep., Department of Computer Science, State University of New York at Stony Brook (1996)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Evans, F., Skiena, S.S., Varshney, A.: Optimizing triangle strips for fast rendering. In: Yagel, R., Nielson G.M. (eds.) IEEE Visualization, pp. 319\u2013326 (1996)","DOI":"10.1109\/VISUAL.1996.568125"},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/364338.364345","volume-title":"SI3D \u201901: Proceedings of the 2001 Symposium on Interactive 3D graphics","author":"M. Garland","year":"2001","unstructured":"Garland, M., Willmott, A., Heckbert, P.S.: Hierarchical face clustering on polygonal surfaces. In: SI3D \u201901: Proceedings of the 2001 Symposium on Interactive 3D graphics, pp. 49\u201358. ACM Press, New York (2001). DOI http:\/\/doi.acm.org\/10.1145\/364338.364345"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Gopi, M.: Controllable single-strip generation for triangulated surfaces. In: Pacific Conference on Computer Graphics and Applications, pp. 61\u201369. IEEE Computer Society (2004)","DOI":"10.1109\/PCCGA.2004.1348335"},{"issue":"3","key":"18_CR19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1111\/j.1467-8659.2004.00768.x","volume":"23","author":"M. Gopi","year":"2004","unstructured":"Gopi, M., Eppstein, D.: Single-strip triangulation of manifolds with arbitrary topology. Comput. Graph. Forum 23(3), 371\u2013379 (2004)","journal-title":"Comput. Graph. Forum"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. In: European Symposium on Algorithms, pp. 179\u2013193. Springer (1996)","DOI":"10.1007\/3-540-61680-2_55"},{"key":"18_CR21","first-page":"269","volume-title":"Siggraph 1999, Computer Graphics Proceedings","author":"H. Hoppe","year":"1999","unstructured":"Hoppe, H.: Optimization of mesh locality for transparent vertex caching. In: A. Rockwood (ed.) Siggraph 1999, Computer Graphics Proceedings, pp. 269\u2013276. Addison Wesley Longman, Los Angeles, CA (1999). URL citeseer.ist.psu.edu\/hoppe99optimization.html"},{"issue":"1","key":"18_CR22","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jagm.1998.0944","volume":"29","author":"H.I. Lu","year":"1998","unstructured":"Lu, H.I., Ravi, R.: Approximating maximum leaf spanning trees in almost linear time. J. Algorithms 29(1), 132\u2013141 (1998)","journal-title":"J. Algorithms"},{"key":"18_CR23","unstructured":"Kornmann, D.: Fast and simple triangle strip generation. In: Varian Medical Systems Finland, Espoo (1999)"},{"key":"18_CR24","unstructured":"Low, K.L., Tan, T.S.: Model simplification using vertex-clustering. In: SI3D \u201997: Proceedings of the 1997 Symposium on Interactive 3D Graphics, pp. 75\u2013ff. ACM Press, New York (1997). DOI http:\/\/doi.acm.org\/10.1145\/253284.253310"},{"key":"18_CR25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/258734.258847","volume-title":"SIGGRAPH \u201997: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques","author":"D. Luebke","year":"1997","unstructured":"Luebke, D., Erikson, C.: View-dependent simplification of arbitrary polygonal environments. In: SIGGRAPH \u201997: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, pp. 199\u2013208. ACM Press\/Addison-Wesley Publishing Co., New York (1997). DOI http:\/\/doi.acm.org\/10.1145\/258734.258847"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Luebke, D., Erikson, C.: View-dependent simplification of arbitrary polygonal environments. Comput. Graph. 31(Annual Conference Series), pp. 199\u2013208 (1997)","DOI":"10.1145\/258734.258847"},{"key":"18_CR27","volume-title":"Level of Detail for 3D Graphics","author":"D. Luebke","year":"2003","unstructured":"Luebke, D., Reddy, M., Cohen, J.D., Varshney, A., Watson, B., Huebner, R.: Level of Detail for 3D Graphics. Morgan Kaufmann Publishers, San Francisco, CA (2003)"},{"issue":"3","key":"18_CR28","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/1015706.1015711","volume":"23","author":"J. Mitani","year":"2004","unstructured":"Mitani, J., Suzuki, H.: Making papercraft toys from meshes using strip-based approximate unfolding. ACM Trans. Graph. 23(3), 259\u2013263 (2004)","journal-title":"ACM Trans. Graph."},{"key":"18_CR29","volume-title":"OpenGL Programming Guide","author":"J. Neider","year":"1993","unstructured":"Neider, J., Davis, T., Woo, M.: OpenGL Programming Guide. Addison Wesley, Reading, MA (1993)"},{"key":"18_CR30","unstructured":"Pajarola, R., Antonijuan, M., Lario, R.: Quadtin: Quadtree based triangulated irregular networks. URL citeseer.ifi.unizh.ch\/pajarola02quadtin.html"},{"issue":"6","key":"18_CR31","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Shafae, M., Pajarola, R.: Dstrips: Dynamic triangle strips for real-time mesh simplification and rendering. In: Jon Rokne, W.W., Klein, R. (eds.) Proceedings Pacific Graphics 2003, pp. 271\u2013280. IEEE (2003)","DOI":"10.1109\/PCCGA.2003.1238269"},{"key":"18_CR33","unstructured":"Stewart, A.J.: Tunneling for triangle strips in continuous level-of-detail meshes. In: Graphics Interface 2001, pp. 91\u2013100. Canadian Formation Processing Society (2001)"},{"issue":"3","key":"18_CR34","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1145\/1073204.1073278","volume":"24","author":"S.E. Yoon","year":"2005","unstructured":"Yoon, S.E., Lindstrom, P., Pascucci, V., Manocha, D.: Cache-oblivious mesh layouts. ACM Trans. Graph. 24(3), 886\u2013893 (2005)","journal-title":"ACM Trans. Graph."},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Vanecek, P., Kolingerov\u00e1, I.: Multi-path algorithm for triangle strips. In: Computer Graphics International, pp. 2\u20139 (2004)","DOI":"10.1109\/CGI.2004.1309186"},{"issue":"1","key":"18_CR36","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s003710050160","volume":"15","author":"L. Velho","year":"1999","unstructured":"Velho, L., de Figueiredo, L.H., Gomes, J.: Hierarchical generalized triangle strips. Visual Comput. 15(1), 21\u201335 (1999)","journal-title":"Visual Comput."},{"key":"18_CR37","unstructured":"Xiang, Held, Mitchell: Fast and effective stripification of polygonal surface models (short). In: SODA: ACM-SIAM Symposium on Discrete Algorithms ( A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) (1999). URL citeseer.ist.psu.edu\/xiang99fast.html"},{"key":"18_CR38","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J.P.C. Peterson","year":"1891","unstructured":"Peterson, J.P.C.: Die theorie der regul\u00e4ren graphen. Acta Mathematica 15, 193\u2013220 (1891)","journal-title":"Acta Mathematica"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-006-0018-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-006-0018-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-006-0018-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T22:48:30Z","timestamp":1736376510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-006-0018-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,12]]},"references-count":38,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["18"],"URL":"https:\/\/doi.org\/10.1007\/s00371-006-0018-2","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"type":"print","value":"0178-2789"},{"type":"electronic","value":"1432-2315"}],"subject":[],"published":{"date-parts":[[2006,5,12]]}}}