Publish in OALib Journal
APC: Only $99
In the paper, an improved algorithm is presented for Delaunay triangulation of the point-set in the plain. Based on the original algorithm, we propose the notion of removing circle. During the process of triangulation, and the circle dynamically moves, the algorithm which is simple and practical, therefore evidently accelerates the process of searching a new point, while generating a new triangle. Then it shows the effect of the algorithm in the finite element mesh.
The paper proves
the convergence theorem of set-valued Superpramart in the sense of weak convergence
under the X* separable
condition. Using support function and results about real-valued Superpramart,
we give the Riesz decomposition of set-valued Superpramart.