Progressive Hulls for Intersection Applications
dc.contributor.author | Platis, Nikos | en_US |
dc.contributor.author | Theoharis, Theoharis | en_US |
dc.date.accessioned | 2015-02-16T07:31:54Z | |
dc.date.available | 2015-02-16T07:31:54Z | |
dc.date.issued | 2003 | en_US |
dc.description.abstract | 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.ACM CSS: I.3.3 Computer Graphics-Picture/Image Generation, I.3.5 Computer Graphics-Computational Geometry and Object Modeling, I.3.7 Computer Graphics-Three-Dimensional Graphics and Realism | en_US |
dc.description.number | 2 | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 22 | en_US |
dc.identifier.doi | 10.1111/1467-8659.00653 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.pages | 107-116 | en_US |
dc.identifier.uri | https://doi.org/10.1111/1467-8659.00653 | en_US |
dc.publisher | Blackwell Publishers, Inc and the Eurographics Association | en_US |
dc.title | Progressive Hulls for Intersection Applications | en_US |