Skip to main content
Log in

On One Approach to the Estimation of a Triangular Element Degeneration in a Triangulation

  • MATHEMATICS
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

Abstract

A quantitative estimate for the quality of a triangular element—the triangle degeneration index—is proposed. To apply this estimate, a simple model triangulation is constructed in which the vertex coordinates are obtained as the sum of the corresponding node coordinates in a given regular grid and their random increments. For various parameter values, the empirical distribution function of the triangle degeneration index is calculated, which is considered a quantitative characteristic of the quality of triangular elements in the constructed triangulation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.

REFERENCES

  1. B. Delaunay, “Sur la sphere vide,” Izv. Akad. Nauk SSSR Otd. Mat. Estestv. Nauk 6, 793–800 (1934).

    MATH  Google Scholar 

  2. R. H. Gallagher, Finite Element Analysis: Fundamentals (Springer-Verlag, Berlin, 1976).

    Book  Google Scholar 

  3. C. A. J. Fletcher, Computational Galerkin Methods (Springer-Verlag, New York, 1984).

    Book  MATH  Google Scholar 

  4. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction (Springer-Verlag, New York, 1985).

    Book  MATH  Google Scholar 

  5. H. Edelsbrunner and R. Seidel, “Voronoi diagrams and arrangements,” Discrete Comput. Geom. 1, 25–44 (1986). https://doi.org/10.1007/BF02187681

    Article  MathSciNet  MATH  Google Scholar 

  6. D. T. Lee and A. K. Lin, “Generalized Delaunay triangulation for planar graphs,” Discrete Comput. Geom. 1, 201–217 (1986). https://doi.org/10.1007/BF02187695

    Article  MathSciNet  MATH  Google Scholar 

  7. L. P. Chew, “Constrained Delaunay triangulations,” Algorithmica 4 (1), 97–108 (1989). https://doi.org/10.1007/BF01553881

    Article  MathSciNet  MATH  Google Scholar 

  8. A. V. Skvortsov and N. S. Mirza, Algorithms for Construction and Analysis of Triangulations (Tomsk. Gos. Univ., Tomsk, 2006) [in Russian].

    Book  Google Scholar 

  9. L. Pournin and Th. M. Liebling, “Constrained paths in the flip-graph of regular triangulations,” Comput. Geom. 37, 134–140 (2007). https://doi.org/10.1016/j.comgeo.2006.07.001

    Article  MathSciNet  MATH  Google Scholar 

  10. Ø. Hjelle and M. Dæhlen, Triangulations and Applications (Springer, Berlin, 2006).

    MATH  Google Scholar 

  11. J. A. De Loera, J. Rambau, and F. Santos, Triangulations: Structures for Algorithms and Applications (Springer, Berlin, 2010).

    Book  MATH  Google Scholar 

  12. I. M. Sobol, The Monte Carlo Method (Mir, Moscow, 1975).

Download references

Funding

This work was performed using facilities of the Center for collective use of high-performance computing resources at Lomonosov Moscow State University. The authors are also grateful to the Center for Information Technology at the University of Groningen (Netherlands) for the opportunity to carry out the computations.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Yu. A. Kriksin or V. F. Tishkin.

Ethics declarations

The authors declare that they have no conflicts of interest.

Additional information

Translated by I. Ruzanova

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kriksin, Y.A., Tishkin, V.F. On One Approach to the Estimation of a Triangular Element Degeneration in a Triangulation. Dokl. Math. 107, 126–129 (2023). https://doi.org/10.1134/S106456242370076X

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S106456242370076X

Keywords:

Navigation