Skinning of circles and spheres

KSpheres – an efficient algorithm for joining skinning surfaces

“…As an alternative method, a direct computation of touching circles of the blending surface patch on the given spheres has been provided in Kunkli and Hoffmann (2010). As has been proved in 2D in Tornai (2012) and Kunkli (2009), this method provides better results than the iterative method presented in Slabaugh et al (2010) in terms of computing time and curvature flow.…”

“…3. But the original algorithm given in Kunkli and Hoffmann (2010) can handle only one single sequence of spheres without further branches. For better understanding of the remaining part of the paper, the basic steps of this original algorithm provided in Kunkli and Hoffmann (2010) will be discussed in the following section.…”

“…The algorithm assures G 1 continuity between the blending patches. For further details of the algorithm see Kunkli and Hoffmann (2010).…”

“…the surface touches) all of the given spheres. As described in Kunkli and Hoffmann (2010) the G 1 continuity of the surface is guaranteed along the branches, while at the junctions of the branches it is also assured by the new method as described in Section 4.2. All given spheres are touched along a circle, and the surface does not intersect the spheres, as follows from the original algorithm.…”

“…Based on the theoretical approach of blending of spheres developed in Kunkli and Hoffmann (2010), the method provides a parametric surface, skinning of a predefined, ordered set of spheres. The surface can be interactively modified in real time by adjusting the positions and radii of the spheres.…”