This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
In this paper a method is presented to fair the limit surface of a subdivision algorithm around an extraordinary point. The eigenvalues and eigenvectors of the subdivision matrix d...
In this paper, we extend a computationally efficient framework for real-time 3D tracking and segmentation to support deformable subdivision surfaces. Segmentation is performed in a...
In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad-dominant mesh with edges aligned to the principal directions of the underlying geome...