Scaffolding skeletons using spherical Voronoi diagrams: Feasibility, regularity and symmetry

Abstract

Given a skeleton made of line segments we describe how to obtain a coarse quad mesh of a surface that encloses tightly the skeleton and follows its structure — the scaffold. We formalize as an Integer Linear Program the problem of constructing an optimal scaffold that minimizes the total number of quads on the mesh. We prove the feasibility of the Integer Linear Program for any skeleton. In particular we can generate these scaffolds for skeletons with cycles. We additionally show how to obtain regular scaffolds, i.e. with the same number of quad patches around each line segment, and symmetric scaffolds that respect the symmetries of the skeleton. An application to polygonization of skeleton-based implicit surfaces is also presented.