Multivariate spline approximation of the signed distance function

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multivariate spline approximation of the signed distance function

The signed distance function can effectively support many geometry processing tasks such as decimates, smoothing and shape reconstruction since it provides efficient access to distance estimates. In this talk, we present an adaptive method to approximate the signed distance function of a smooth curve by using polynomial splines over type-2 triangulation. The trimmed offsets are also studied.

متن کامل

Medial Axis Computation using a Hierarchical Spline Approximation of the Signed Distance Function

We present a new method for computing the medial axis of a given closed smooth curve or surface. It is based on an algorithm for approximating the signed distance function using polynomial splines over hierarchical T-meshes, which has recently been presented in [36]. Since the signed distance function is not differentiable along the medial axis, the hierarchical T-meshes is automatically refine...

متن کامل

Piecewise Linear Approximation of Signed Distance Fields

The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient access to distance (error) estimates. In this paper we present an algorithm to compute a piecewise linear, not necessarily continuous approximation of the signed distance field for a given object. Our approach is based on...

متن کامل

Multivariate spectral approximation in the Hellinger distance

We first describe a globally convergent matricial Newton-type algorithm designed to solve the multivariable spectrum approximation problem. Then, we apply this approximation procedure to the estimation of multivariate spectral densities, and test its effectiveness through simulation.

متن کامل

Minimizing the symmetric difference distance in conic spline approximation

We show that the complexity (the number of elements) of an optimal parabolic or conic spline approximating a smooth curve with nonvanishing curvature to within symmetric difference distance ε is c1 ε −1/4 + O(1), if the spline consists of parabolic arcs and c2 ε −1/5 +O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the affine curvature of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2014

ISSN: 0377-0427

DOI: 10.1016/j.cam.2013.09.043