García, Ángel LuisMiras, Juan Ruiz deFeito, Francisco R.Pere Brunet and Nuno Correia and Gladimir Baranoski2014-01-312014-01-3120063-905673-60-6https://doi.org/10.2312/LocalChapterEvents/siacg/siacg06/149-158We present a method to handle cubic trimmed triangular Bézier patches. This scheme makes use of levels of detail and surface subdivision to achieve a fast and flexible hierarchical data structure that is specially useful to compute surface intersections in a robust and efficient way. The accuracy of the results can be adjusted by adding or subtracting elements to the levels of detail hierarchy, and it is also easy to obtain a decomposition of a trimmed patch into single triangular Bézier patches.Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling.