An algorithm for creating smooth spline surfaces over irregular meshes is presented. The algorithm is a generalization of quadratic B-splines; that is, if a mesh is (locally) regu...
We consider a parameterized family of closed planar curves and introduce an evolution process for identifying a member of the family that approximates a given unorganized point cl...
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
We present algorithms to produce Delaunay meshes from arbitrary triangle meshes by edge flipping and geometrypreserving refinement and prove their correctness. In particular we sh...
A well-known method of estimating the length of a parametric curve in Rd is to sample some points from it and compute the length of the polygon passing through them. In this paper...
Michael S. Floater, Atgeirr F. Rasmussen, Ulrich R...