Nacrtak This paper describes a program for optimizing forest road alignments using the Dijkstra shortest path method and a cubic spline function. We previously developed a method for optimizing forest road alignments once a series of intersection points (IPs) were selected manually using Tabu Search. The application of the program to a part of Capitol State Forest in Washington State, USA indic...

introduction studies about the health effects of long-term average exposure to outdoor air pollution have played an important role in the recent health impact assessments. exposure assessment for epidemiological studies of long-term exposure to ambient air pollution remains a difficult challenge because of substantial small-scale spatial variation. current approaches for assessing intra-urban ai...

A B-spline snake algorithm is proposed for the segmentation of the knee joint cartilage from MR images. A rst guess of the contour is provided interactively and is transformed into a B-spline representation. Image forces attract the B-spline curve towards the real cartilage boundaries. In addition, model forces based on a distance transformation are introduced in order to guide the evolution of...

In this paper, nonlinear integral equations have been solved numerically by using B-spline wavelet method and Variational Iteration Method (VIM). Compactly supported semi-orthogonal linear B-spline scaling and wavelet functions together with their dual functions are applied to approximate the solutions of nonlinear Fredholm integral equations of second kind. Comparisons are made between the var...

In this paper, the Bagley-Torvik equation is constructed. A model approach based on non-polynomial numerical methods spline interpolation is developed to solve some problems. We show that the approximate solutions of such problems obtained by the numerical algorithm developed using non-polynomial spline interpolation functions are better than those produced by other numerical methods. The aim o...

This paper presents a spline approximation method for the representation of a large set of points. The representation should be smooth with preserving important shape characteristics given by the points. Because of a large size of the set, the standard spline interpolation cannot be used. The proposed method is based on a least squares minimization of the distances of the points from the spline...

In this paper, we show that the shifts of a pseudo-spline are linearly independent. This is stronger than the (more obvious) statement that the shifts of a pseudo-spline form a Riesz system. In fact, the linear independence of a compactly supported (refinable) function and its shifts has been studied in several areas of approximation and wavelet theory (see e.g. [4], [9], [10], [13], [14], [16]...

Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage of SDM is that it does not need a parameterization of data points on the target curve. Starting with an initial B-spline curve, this scheme makes an active B-spline curve converge faster towards the target curve and pro...