Abstract:
The article is devoted to generalization of Delaunay triangulation. We suggest to consider empty condition for special convex sets. For given finite set P⊂Rn we shall say that empty condition for convex set B⊂Rn is fullfiled if P∩B=P∩∂B. Let Φ=Φα,α∈A be a family of compact convex sets with non empty inner. Consider some nondegenerate simplex S⊂Rn with vertexes p0,...,pn. We define the girth set B(S)∈Φ if qi∈∂B(S),i=0,1,...,n. We suppose that the family Φ has the property: for arbitrary nondegenerate simplex S there is only one the girth set B(S). We prove the following main result.
Theorem 1.
If the family Φ=Φα,α∈A of convex sets have the pointed above property then for the girth sets it is true:
The set B(S) is uniquely determined by any simplex with vertexes on ∂B(S).
Let S1,S2 be two nondegenerate simplexes such that B(S1)≠B(S2). If the intersection B(S1)∩B(S2) is not empty, then the intersection of boundaries B(S1),B(S2) is (n−2)-dimensional convex surface, lying in some hyperplane.
If two simplexes S1 and S2 don't intersect by inner points and have common (n−1)-dimensional face G and A, B are vertexes don't belong to face G and vertex B of simplex B(S2) such that B∉B(S1) then B(S2) does not contain the vertex A of simplex S1.
These statements allow us to define Φ-triangulation correctly by the following way. The given triangulation T of finite set P⊂Rn is called Φ-triangulation if for all simlex S∈T the girth set B(S)∈Phi is empty.
In the paper we give algorithm for construct Φ-triangulation arbitrary finite set P⊂Rn.
Besides we describe exapmles of families Φ for which we prove the existence and uniqueness of girth set B(S) for arbitrary nondegenerate simplex S.
Citation:
V. A. Klyachin, “Triangulation algorithm based on empty convex set condition”, Vestnik Volgogradskogo gosudarstvennogo universiteta. Seriya 1. Mathematica. Physica, 2015, no. 3(28), 27–33
\Bibitem{Kly15}
\by V.~A.~Klyachin
\paper Triangulation algorithm based on empty convex set condition
\jour Vestnik Volgogradskogo gosudarstvennogo universiteta. Seriya 1. Mathematica. Physica
\yr 2015
\issue 3(28)
\pages 27--33
\mathnet{http://mi.mathnet.ru/vvgum65}
\crossref{https://doi.org/10.15688/jvolsu1.2015.3.3}
Linking options:
https://www.mathnet.ru/eng/vvgum65
https://www.mathnet.ru/eng/vvgum/y2015/i3/p27
This publication is cited in the following 4 articles:
V. A. Klyachin, “Approximation of the gradient of a function on the basis of a special
class of triangulations”, Izv. Math., 82:6 (2018), 1136–1147
V. A. Klyachin, M. I. Kazanin, “Postroenie reshenii uravneniya tipa Monzha–Ampera na osnove $\Phi$-triangulyatsii”, Vestn. Volgogr. gos. un-ta. Ser. 1, Mat. Fiz., 2017, no. 1(38), 6–12
V. A. Klyachin, E. G. Grigorieva, “Description of functionals that are minimized by $\Phi$-triangulations”, J. Math. Sci. (N. Y.), 241:3 (2019), 251–257