An approximating algorithm on handling 3-D points cloud data was discussed for reconstruction of complicated curved surface. In this algorithm, the coordinate information of nodes both in internal and external regions...
详细信息
An approximating algorithm on handling 3-D points cloud data was discussed for reconstruction of complicated curved surface. In this algorithm, the coordinate information of nodes both in internal and external regions of partition interpolation was used to realize minimized least squares approximation error of surface fitting. The changes between internal and external interpolation regions are continuous and smooth. Meanwhile, surface shape has properties of local controllability, variation reduction, and convex hull. The practical example shows that this algorithm possesses a higher accuracy of curved surface reconstruction and also improves the distortion of curved surface reconstruction when typical approximating algorithms and unstable operation are used.
For reconstruction of complicated curved surface,an approximating algorithm on handling 3D points cloud data is *** this algorithm,the coordinate information of nodes both in internal and external regions of partition...
详细信息
For reconstruction of complicated curved surface,an approximating algorithm on handling 3D points cloud data is *** this algorithm,the coordinate information of nodes both in internal and external regions of partition interpolation is used to realize minimized least squares approximation error of surface *** changes between internal and external interpolation regions are continuous and ***,surface shape has properties of local controllability,variation reduction,and convex hull thanks to this *** practical example proves that this algorithm possesses a higher accuracy of curved surface reconstruction and also improves the distortion of curved surface reconstruction while typical approximating algorithms and unstable operation are used.
In this article, some existence and uniqueness of solutions for a new class of global fractional-order projective dynamical system with delay and perturbation are proved by employing the Krasnoselskii fixed point theo...
详细信息
In this article, some existence and uniqueness of solutions for a new class of global fractional-order projective dynamical system with delay and perturbation are proved by employing the Krasnoselskii fixed point theorem and the Banach fixed point theorem. Moreover, an approximating algorithm is also provided to find a solution of the global fractional-order projective dynamical system. Finally, an application to the idealized traveler information systems for day-to-day adjustments processes and a numerical example are given.
Let P be an x-monotone polygonal path in the plane. For a path Q that approximates P let W-A(Q) be the area above P and below Q, and let W-B(Q) be the area above Q and below P. Given P and an integer k, we show how to...
详细信息
Let P be an x-monotone polygonal path in the plane. For a path Q that approximates P let W-A(Q) be the area above P and below Q, and let W-B(Q) be the area above Q and below P. Given P and an integer k, we show how to compute a path Q with at most k edges that minimizes W-A(Q)+W-B(Q). Given P and a cost C, we show how to find a path Q with the smallest possible number of edges such that W-A(Q)+W-B(Q)<= C. However, given P, an integer k, and a cost C, it is NP-hard to determine if a path Q with at most k edges exists such that max{W-A(Q),W-B(Q)}<= C. We describe an approximation algorithm for this setting. Finally, it is also NP-hard to decide whether a path Q exists such that |W-A(Q)-W-B(Q)|=0. Nevertheless, in this error measure we provide an algorithm for computing an optimal approximation up to an additive error. (C) 2005 Elsevier *** rights reserved.
Weather has a significant influence on navigation processes. Driving during a heavy rain, for example, is slower and due to poor visibility more dangerous than driving in perfect weather conditions. Thus from time man...
详细信息
ISBN:
(纸本)9783642290633
Weather has a significant influence on navigation processes. Driving during a heavy rain, for example, is slower and due to poor visibility more dangerous than driving in perfect weather conditions. Thus from time management and safety perspective including weather information is beneficial. Weather, especially rain may also be critical for transportation tasks since some commodities like straw or sand should not get wet. In the last years, the quality of weather information and weather forecast has improved and could be used to improve route planning. The paper discusses how weather information can be included in route planning algorithms. A first approximating algorithm to incorporate weather forecast data is presented. Some examples showing the impact on route planning conclude the paper.
In computing electronic structure and energy band in the systems of multiparticles, quite a large number of problems are to obtain the partial sum of the densities and energies by using "First principle". In...
详细信息
In computing electronic structure and energy band in the systems of multiparticles, quite a large number of problems are to obtain the partial sum of the densities and energies by using "First principle". In the ordinary method, the so-called self-consistency approach, the procedure is limited to a small scale because of its high computing complexity. In this paper, the problem of computing the partial sum for a class of nonlinear nonlinear Schrodinger eigenvalue equations is changed into the constrained functional minimization. By spare decomposition and Rayleigh-Schrodinger method, one approximating formula for the minimal is provided. The numerical experiments show that this formula is more precise and its quantity of computation is smaller.
In computing the electronic structure and energy band in a system of multi-particles, quite a large number of problems are referred to the acquisition of obtaining the partial sum of densities and energies using the &...
详细信息
In computing the electronic structure and energy band in a system of multi-particles, quite a large number of problems are referred to the acquisition of obtaining the partial sum of densities and energies using the "first principle". In the conventional method, the so-called self-consistency approach is limited to a small scale because of high computing complexity. In this paper, the problem of computing the partial sum for a class of nonlinear differential eigenvalue equations is changed into the constrained functional minimization. By space decomposition and perturbation method, a secondary approximating formula for the minimal is provided. It is shown that this formula is more precise and its quantity of computation can be reduced significantly.
暂无评论