RUS  ENG
Full version
JOURNALS // Numerical methods and programming // Archive

Num. Meth. Prog., 2002 Volume 3, Issue 1, Pages 82–92 (Mi vmp741)

This article is cited in 3 papers

Algorithms for constructing triangulations with constraints

A. V. Skvortsov

Tomsk State University

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



© Steklov Math. Inst. of RAS, 2025