Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
In this paper we present a new algorithm for solving the data dependent fairing problem for subdivision surfaces, using Catmull-Clark surfaces as an example. Earlier approaches to...
In this paper, we propose a new scheme for free-form skeletondriven global mesh deformations. First a Voronoi-based skeletal mesh is extracted from a given original mesh. Next the...
Shin Yoshizawa, Alexander G. Belyaev, Hans-Peter S...
This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approach...
Tolga Tasdizen, Ross T. Whitaker, Paul Burchard, S...
Visualization techniques enable scientists to interactively explore 3D data sets, segmenting and cutting them to reveal inner structure. While powerful, these techniques suffer fr...