Numerical methods and programming
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


Num. Meth. Prog.:
Year:
Volume:
Issue:
Page:
Find




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

Numerical methods and programming, 2002, Volume 3, Issue 1, Pages 82–92 (Mi vmp741)  
This article is cited in 3 scientific papers (total in 3 papers)

Algorithms for constructing triangulations with constraints

A. V. Skvortsov

Tomsk State University
Full-text PDF (237 kB) Citations (3)
Abstract: We consider the problem of constructing triangulations with constraints and discuss a number of the corresponding algorithms. The problem of computing stability of these algorithms is studied. A stable modification of the algorithm for constructing a Delaunay triangulation with constraints is proposed.
Keywords: triangulation, computational geometry, computer graphycs, grid construction, data structure, numerical stability.
UDC: 519.688
Language: Russian
Citation: A. V. Skvortsov, “Algorithms for constructing triangulations with constraints”, Num. Meth. Prog., 3:1 (2002), 82–92
Citation in format AMSBIB
\Bibitem{Skv02}
\by A.~V.~Skvortsov
\paper Algorithms for constructing triangulations with constraints
\jour Num. Meth. Prog.
\yr 2002
\vol 3
\issue 1
\pages 82--92
\mathnet{http://mi.mathnet.ru/vmp741}
Linking options:
  • https://www.mathnet.ru/eng/vmp741
  • https://www.mathnet.ru/eng/vmp/v3/i1/p82
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Numerical methods and programming
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025