Delaunay triangulation has been widely used in many fields such as compu- tational fluid dynamics, statistics, meteorology solid state physics, computational geometry and so on. Bowyer-Watson algorithm is a very popul...
详细信息
Delaunay triangulation has been widely used in many fields such as compu- tational fluid dynamics, statistics, meteorology solid state physics, computational geometry and so on. Bowyer-Watson algorithm is a very popular one for generating Delaunay triangulation. In generating the Delaunay triangulation of a preassigned set of n points, the complexity of Bowyer-Watson algorithm can at most be reduced to O(n log n) for the simple reason that the complexity of its tree search process is O(nlog n). In this paper we suggest a tree search technique whose complexity is O(n). Noting that the order of point insertion can affect the efficiency of Bowyer- Watson algorithm, we propose a technique to optimize the point insertion process. Based on these two techniques, we obtain a fast algorithm for generating Delaunay triangulation.
In this paper, a numerical method is developed for solving one-dimensional hyperbolic system of conservation laws by the Taylor-Galerkin finite element method. The scheme is obtained by solving conservation equations ...
详细信息
In this paper, a numerical method is developed for solving one-dimensional hyperbolic system of conservation laws by the Taylor-Galerkin finite element method. The scheme is obtained by solving conservation equations associated HamiltonJacobi equations. The scheme has the TVD-like property under the uniform meshes. Numerical examples are given.
暂无评论