Premium
Interference Detection for Subdivision Surfaces
Author(s) -
Wu Xiaobin,
Peters Jörg
Publication year - 2004
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2004.00789.x
Subject(s) - subdivision , subdivision surface , polyhedron , computer science , interference (communication) , offset (computer science) , intersection (aeronautics) , ray tracing (physics) , surface (topology) , collision detection , algorithm , computer graphics , limit (mathematics) , polygon mesh , exponential function , computer graphics (images) , geometry , mathematics , optics , mathematical analysis , physics , computer network , channel (broadcasting) , archaeology , computer security , collision , engineering , history , programming language , aerospace engineering
Accurate 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 Modeling