Show simple item record

dc.contributor.authorWu, Xiaobinen_US
dc.contributor.authorPeters, Joergen_US
dc.date.accessioned2015-02-19T09:54:44Z
dc.date.available2015-02-19T09:54:44Z
dc.date.issued2004en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/j.1467-8659.2004.00789.xen_US
dc.description.abstractAccurate and robust interference detection and ray-tracing of subdivision surfaces requires safe linear approximations. Approximation of the limit surface by the subdivided control polyhedron can be both inaccurate and, due to the exponential growth of the number of facets, costly.This paper shows how a standard intersection hierarchy, such as an OBB tree, can be made safe and efficient for subdivision surface interference detection. The key is to construct, on the fly, optimally placed facets, whose spherical offsets tightly enclose the limit surface. The spherically offset facets can be locally subdivided and they can be efficiently intersected based on standard triangle-triangle interference detection.Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modelingen_US
dc.publisherThe Eurographics Association and Blackwell Publishing, Incen_US
dc.titleInterference Detection for Subdivision Surfacesen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume23en_US
dc.description.number3en_US
dc.identifier.doi10.1111/j.1467-8659.2004.00789.xen_US
dc.identifier.pages577-584en_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record