{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:18:36Z","timestamp":1743117516923,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031220241"},{"type":"electronic","value":"9783031220258"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22025-8_13","type":"book-chapter","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T23:15:19Z","timestamp":1676070919000},"page":"183-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Triangle Strip Generation and Tunneling for Different Cost Metrics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3509-9587","authenticated-orcid":false,"given":"Jonas","family":"Treumer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1083-4653","authenticated-orcid":false,"given":"Lorenzo","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Lorenz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0505-9338","authenticated-orcid":false,"given":"Bastian","family":"Pfleging","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,11]]},"reference":[{"key":"13_CR1","unstructured":"Akeley, K., Haeberli, P., Burns, D.: The tomesh.c program. Available on SGI computers and developers toolbox CD 40 (1990)"},{"key":"13_CR2","unstructured":"Akenine-M$$\\ddot{\\rm o}$$ller, T., Haines, E., Hoffman, N.: Real-Time Rendering. AK Peters\/CRC Press, 3 edn. (2008), p. 552"},{"issue":"9","key":"13_CR3","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF01782475","volume":"12","author":"EM Arkin","year":"1996","unstructured":"Arkin, E.M., Held, M., Mitchell, J.S., Skiena, S.S.: Hamiltonian triangulations for fast rendering. Vis. Comput. 12(9), 429\u2013444 (1996)","journal-title":"Vis. Comput."},{"key":"13_CR4","unstructured":"Beeson, C., Demer, J.: NvTriStrip Library (2000), https:\/\/www.nvidia.com\/object\/nvtristrip_library.html"},{"key":"13_CR5","unstructured":"Eckel, G., Jones, K.: OpenGL Performer Programmer\u2019s Guide. Silicon Graphics, Inc (2000)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Evans, F., Skiena, S., Varshney, A.: Optimizing triangle strips for fast rendering. In: Proceedings of Seventh Annual IEEE Visualization\u201996. pp. 319\u2013326. IEEE (1996)","DOI":"10.1109\/VISUAL.1996.568125"},{"key":"13_CR7","unstructured":"Evans, F., Skiena, S., Varshney, A., Azanli, E.: Stripe v2.0: A Software Tool for Efficient Triangle Strips (1998), https:\/\/www3.cs.stonybrook.edu\/~stripe\/"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The Planar Hamiltonian Circuit Problem is NP-Complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Kerbl, B., Kenzel, M., Ivanchenko, E., Schmalstieg, D., Steinberger, M.: Revisiting the vertex cache: Understanding and optimizing vertex processing on the modern gpu. Proc. ACM Comput. Graph. Interact. Tech. 1(2) (aug 2018), https:\/\/doi.org\/10.1145\/3233302","DOI":"10.1145\/3233302"},{"key":"13_CR10","unstructured":"Levoy, M., Gerth, J., Curless, B., Pull, K.: The Stanford 3D Scanning Repository (2005), https:\/\/graphics.stanford.edu\/data\/3Dscanrep\/"},{"key":"13_CR11","unstructured":"Porcu, M.B., Scateni, R.: An Iterative Stripification Algorithm Based on Dual Graph Operations. In: Proceedings of Eurographics. pp. 69\u201375 (2003)"},{"key":"13_CR12","unstructured":"Porcu, M.B., Scateni, R.: Partitioning Meshes into Strips using the Enhanced Tunnelling Algorithm (ETA). In: VRIPHYS. pp. 61\u201370 (2006)"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1080\/2151237X.2005.10129196","volume":"10","author":"P Reuter","year":"2005","unstructured":"Reuter, P., Behr, J., Alexa, M.: An Improved Adjacency Data Structure for Fast Triangle Stripping. Journal of Graphics Tools 10(2), 41\u201350 (2005)","journal-title":"Journal of Graphics Tools"},{"key":"13_CR14","unstructured":"Stewart, A.J.: Tunneling for Triangle Strips in Continuous Level-of-Detail Meshes. In: Graphics Interface. pp. 91\u2013100 (2001)"},{"key":"13_CR15","unstructured":"Terdiman, P.: Creating efficient triangle strips (2000), http:\/\/www.codercorner.com\/Strips.htm"}],"container-title":["Lecture Notes in Networks and Systems","Computer Vision and Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22025-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T23:49:45Z","timestamp":1728863385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22025-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031220241","9783031220258"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22025-8_13","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCVG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Vision and Graphics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccvg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccvg.sggw.edu.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}