Piecewise smooth subdivision surfaces with normal control
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Rapid evaluation of Catmull-Clark subdivision surfaces
Proceedings of the seventh international conference on 3D Web technology
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Combining 4- and 3-direction subdivision
ACM Transactions on Graphics (TOG)
A realtime GPU subdivision kernel
ACM SIGGRAPH 2005 Papers
IEEE Micro
ACM SIGGRAPH 2006 Papers
OpenKODE: an open mobile media development environment
ACM SIGGRAPH 2006 Courses
PNG1 triangles for tangent plane continuous surfaces on the GPU
GI '08 Proceedings of graphics interface 2008
Parallel subdivision surface rendering and animation on the cell BE processor
Proceedings of the Conference on Design, Automation and Test in Europe
Primitive processing and advanced shading architecture for embedded space
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
A system for real-time deformable terrain
Proceedings of the South African Institute of Computer Scientists and Information Technologists Conference on Knowledge, Innovation and Leadership in a Diverse, Multidisciplinary Environment
Beyond Catmull–Clark? A Survey of Advances in Subdivision Surface Methods
Computer Graphics Forum
Hi-index | 0.00 |
Subdivision surfaces possess many appealing properties applicable to interactive computer graphics. However, the necessity to access a variable-sized neighborhood in a control mesh makes it difficult to efficiently accelerate tessellation calculations in graphics hardware. The paper addresses this problem in two ways. First, it proposes a simple and inexpensive calculation scheme for the tessellation of Catmull-Clark subdivision surfaces which can be implemented in a geometry shader. It operates on the shader's vertex input only and does not require external texture memory access or multi-pass processing for tessellation. Second, the paper presents an extension to the post-transform and lighting (T'n'L) vertex cache operation that efficiently accelerates the processing of variable-size primitives serving as input for the geometry shader. We demonstrate on-chip tessellation of Catmull-Clark subdivision surfaces on an embedded hardware implementation. The described calculation scheme will be implementable on desktop hardware if limitations on the maximal input primitive size for the geometry shader are relaxed.