Skip to search formSkip to main contentSkip to account menu

Catmull–Clark subdivision surface

Known as: Catmull-Clark subdivision, Catmull–Clark, Catmull-clark 
The Catmull–Clark algorithm is a technique used in computer graphics to create smooth surfaces by subdivision surface modeling. It was devised by… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Generating smooth surfaces of arbitrary topology is a major challenge in geometric modeling, computer graphics, and scientific… 
2011
2011
For Catmull-Clark subdivision surface with boundary,this paper gives computation formula for limiting point and its corresponding… 
2007
2007
In this paper we describe our approach for computing subdivision surfaces. We proceed in two ways. The first is computing on CPU… 
2007
2007
Subdivision surfaces possess many appealing properties applicable to interactive computer graphics. However, the necessity to… 
2006
2006
AbstractThis paper pursues an approach for the construction of smooth surfaces for geometric modeling and computer graphics… 
2005
2005
AbstractThis paper outlines an approach for the interpolation of scattered data points by Catmull-Clark subdivision surfaces… 
2005
2005
We present a novel method for determining local multiresolution filters for B-spline subdivision curves of any order. Our… 
2004
2004
AbstractA method to scale a Catmull-Clark subdivision surface while holding the shape and size of specific features (sub… 
2004
2004
AbstractThe problem of constructing a smooth subdivision surface interpolating multiple intersecting curves was partially… 
2004
2004
In this paper, both general and exponential bounds of the distance between a uniform Catmull-Clark surface and its control…