Efficient Trimmed NURBS Tessellation
Efficient Trimmed NURBS Tessellation
Á. Balázs,M. Guthe,Reinhard Klein
2004 · DBLP: conf/wscg/BalazsGK04
International Conference in Central Europe on Computer Graphics and Visualization · 20 Citations
TLDR
This paper presents an efficient – with respect to both runtime and to the number of generated triangles – tessellation algorithm for trimmed NURBS surfaces that is capable of guaranteeing a specified geometric approximation error.