RUS  ENG
Full version
JOURNALS // Mathematical Physics and Computer Simulation // Archive

Vestnik Volgogradskogo gosudarstvennogo universiteta. Seriya 1. Mathematica. Physica, 2015 Issue 3(28), Pages 27–33 (Mi vvgum65)

This article is cited in 5 papers

Applied mathematics

Triangulation algorithm based on empty convex set condition

V. A. Klyachin

Volgograd State University

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\subset \mathbb{R}^n$ we shall say that empty condition for convex set $B\subset \mathbb{R}^n$ is fullfiled if $P\cap B=P\cap \partial B$. Let $\Phi=\Phi_{\alpha}, \alpha \in {\mathcal A}$ be a family of compact convex sets with non empty inner. Consider some nondegenerate simplex $S\subset \mathbb{R}^n$ with vertexes $p_0,...,p_n$. We define the girth set $B(S)\in \Phi$ if $q_i\in \partial B(S), i=0,1,...,n$. We suppose that the family $\Phi$ 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 $\Phi=\Phi_{\alpha}, \alpha\in {\mathcal A}$ of convex sets have the pointed above property then for the girth sets it is true:
These statements allow us to define $\Phi$-triangulation correctly by the following way. The given triangulation $T$ of finite set $P\subset \mathbb{R}^n$ is called $\Phi$-triangulation if for all simlex $S\in T$ the girth set $B(S)\in Phi$ is empty. In the paper we give algorithm for construct $\Phi$-triangulation arbitrary finite set $P\subset \mathbb{R}^n$. Besides we describe exapmles of families $\Phi$ for which we prove the existence and uniqueness of girth set $B(S)$ for arbitrary nondegenerate simplex $S$.

Keywords: triangulation, empty shpere condition, Delaunay triangulation, convex set, convex function, convex hull.

UDC: 514.142.2+514.174.6
BBK: 32.973.26-018.2

DOI: 10.15688/jvolsu1.2015.3.3



© Steklov Math. Inst. of RAS, 2025