Constriction Computation using Surface Curvature

In this paper, we present a math- ematical analysis of the velocity obstacle algorithm applied to a vehicle that is subject to nonholonomic constraints, for avoiding a moving

(15) The velocity vectors v ca (j) will keep the constant avoidance angle α o to the obstacle, and will hence be used as candidates for the desired vehicle velocity in

We must also study conditions about our seed curves and the simplification algorithm to be sure to detect all constric- tions, or at least all constrictions we need to decompose

In this approach, we first extract the silhouette of both the coarse and fine meshes using the algorithm from Sander et al. We then perform loop decomposition on the fine

Our algorithm deforms a closed oriented pseudo-surface embedded in the 3D Delaunay triangulation of the sampled points, and the reconstructed surface consists of a set of

In this paper we present an algorithm that uses these properties to generate a piecewise linear approximation of implicit curves and surfaces, that is isotopic to the curve or

The tandem algorithm combines the marching cube algorithm for surface extraction and the edge contraction algorithm for surface simplification in lock-step to avoid the

Rather than advecting texture coordinates on the surface, our algorithm synthesizes a new texture for every frame using an optimization procedure which attempts to match the