Show simple item record

dc.contributor.authorPlatis, Nikosen_US
dc.contributor.authorTheoharis, Theoharisen_US
dc.date.accessioned2015-02-16T07:31:54Z
dc.date.available2015-02-16T07:31:54Z
dc.date.issued2003en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/1467-8659.00653en_US
dc.description.abstractProgressive 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 Realismen_US
dc.publisherBlackwell Publishers, Inc and the Eurographics Associationen_US
dc.titleProgressive Hulls for Intersection Applicationsen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume22en_US
dc.description.number2en_US
dc.identifier.doi10.1111/1467-8659.00653en_US
dc.identifier.pages107-116en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record