Vestnik Volgogradskogo gosudarstvennogo universiteta. Seriya 1. Mathematica. Physica
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mathematical Physics and Computer Simulation:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik Volgogradskogo gosudarstvennogo universiteta. Seriya 1. Mathematica. Physica, 2015, Issue 3(28), Pages 27–33
DOI: https://doi.org/10.15688/jvolsu1.2015.3.3
(Mi vvgum65)
 

This article is cited in 5 scientific papers (total in 5 papers)

Applied mathematics

Triangulation algorithm based on empty convex set condition

V. A. Klyachin

Volgograd State University
Full-text PDF (365 kB) Citations (5)
References:
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:
  • The set $B(S)$ is uniquely determined by any simplex with vertexes on $\partial B(S)$.
  • Let $S_1,S_2$ be two nondegenerate simplexes such that $B(S_1)\ne B(S_2)$. If the intersection $B(S_1)\cap B(S_2)$ is not empty, then the intersection of boundaries $B(S_1), B(S_2)$ is $(n-2)$-dimensional convex surface, lying in some hyperplane.
  • If two simplexes $S_1$ and $S_2$ 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(S_2)$ such that $B\not \in B(S_1)$ then $B(S_2)$ does not contain the vertex $A$ of simplex $S_1$.

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.
Funding agency Grant number
Russian Foundation for Basic Research 15-41-02517
Document Type: Article
UDC: 514.142.2+514.174.6
BBC: 32.973.26-018.2
Language: Russian
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
Citation in format AMSBIB
\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 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Mathematical Physics and Computer Simulation
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025