{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,29]],"date-time":"2024-06-29T06:33:14Z","timestamp":1719642794931},"reference-count":19,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T00:00:00Z","timestamp":1057536000000},"content-version":"vor","delay-in-days":36,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"published-print":{"date-parts":[[2003,6]]},"abstract":"Abstract<\/jats:title> Progressive meshes are an established tool for triangle mesh simplification. By suitably adapting the simplification process, progressive hulls can be generated which enclose the original mesh in gradually simpler, nested meshes. We couple progressive hulls with a selective refinement framework and use them in applications involving intersection queries on the mesh. We demonstrate that selectively refinable progressive hulls considerably speed up intersection queries by efficiently locating intersection points on the mesh. Concerning the progressive hull construction, we propose a new formula for assigning edge collapse priorities that significantly accelerates the simplification process, and enhance the existing algorithm with several conditions aimed at producing higher quality hulls. Using progressive hulls has the added advantage that they can be used instead of the enclosed object when a lower resolution of display can be tolerated, thus speeding up the rendering process.<\/jats:italic> <\/jats:p> ACM CSS:<\/jats:bold> I.3.3 Computer Graphics\u2014Picture\/Image Generation<\/jats:italic>, I.3.5 Computer Graphics\u2014Computational Geometry and Object Modeling<\/jats:italic>, I.3.7 Computer Graphics\u2014Three\u2010Dimensional Graphics and Realism<\/jats:italic><\/jats:p>","DOI":"10.1111\/1467-8659.00653","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T16:18:45Z","timestamp":1057594725000},"page":"107-116","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Progressive Hulls for Intersection Applications"],"prefix":"10.1111","volume":"22","author":[{"given":"Nikos","family":"Platis","sequence":"first","affiliation":[]},{"given":"Theoharis","family":"Theoharis","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2003,7,7]]},"reference":[{"key":"e_1_2_7_2_2","first-page":"99","article-title":"Progressive Meshes","author":"Hoppe H.","journal-title":"In SIGGRAPH 96 Proceedings"},{"key":"e_1_2_7_3_2","first-page":"209","article-title":"Surface Simplification Using Quadric Error Metrics","author":"Garland M.","journal-title":"In SIGGRAPH 97 Proceedings"},{"key":"e_1_2_7_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/2945.773810"},{"key":"e_1_2_7_5_2","first-page":"43","article-title":"A General Framework for Mesh Decimation","author":"Kobbelt L.","journal-title":"Proceedings of Graphics Interface '98"},{"key":"e_1_2_7_6_2","first-page":"279","article-title":"Fast and Memory Efficient Polygonal Simplification","author":"Lindstrom P.","journal-title":"Proceedings of IEEE Visualization '98"},{"key":"e_1_2_7_7_2","article-title":"Multiresolution Modeling: Survey & Future Opportunities","author":"Garland M.","year":"1999","journal-title":"State of the Art Report, Eurographics '99"},{"key":"e_1_2_7_8_2","article-title":"Simplification, LOD and Multiresolution \u2014 Principles and Applications","author":"Puppo E.","year":"1997","journal-title":"Eurographics '97 Tutorial Notes"},{"key":"e_1_2_7_9_2","first-page":"189","article-title":"View\u2010Dependent Refinement of Progressive Meshes","author":"Hoppe H.","journal-title":"SIGGRAPH 97 Proceedings"},{"key":"e_1_2_7_10_2","first-page":"327","article-title":"Dynamic View\u2010Dependent Simplification for Polygonal Models","author":"Xia J. C.","journal-title":"Proceedings of IEEE Visualization '96"},{"key":"e_1_2_7_11_2","first-page":"103","article-title":"Building and Traversing a Surface at Variable Resolution","author":"Floriani L. D.","journal-title":"Proceedings of IEEE Visualization '97"},{"key":"e_1_2_7_12_2","first-page":"327","article-title":"Silhouette Clipping","author":"Sander P. V.","journal-title":"SIGGRAPH 2000 Proceedings"},{"key":"e_1_2_7_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032047"},{"key":"e_1_2_7_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/2945.675649"},{"key":"e_1_2_7_15_2","first-page":"171","article-title":"OBBTree: A Hierarchical Structure for Rapid Interference Detection","author":"Gottschalk S.","journal-title":"SIGGRAPH 96 Proceedings"},{"issue":"80","key":"e_1_2_7_16_2","first-page":"23","article-title":"Topology Preserving Edge Contraction","volume":"66","author":"Dey T. K.","year":"1999","journal-title":"Publications de l'Institut Math\u00e9matique (Beograd)"},{"key":"e_1_2_7_17_2","author":"Cormen T. H.","year":"1990","journal-title":"Introduction to Algorithms"},{"key":"e_1_2_7_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/2945.910820"},{"key":"e_1_2_7_19_2","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.1997.10487468"},{"key":"e_1_2_7_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574699"}],"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2F1467-8659.00653","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/1467-8659.00653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T04:50:15Z","timestamp":1697172615000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/1467-8659.00653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["10.1111\/1467-8659.00653"],"URL":"https:\/\/doi.org\/10.1111\/1467-8659.00653","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,6]]},"assertion":[{"value":"2003-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}