Страница публикации

Algorithm for improvement of digital terrain models represented by triangulations

Тип публикации: Статья в журнале

Тип материала: Текст

Авторы: Hmelnov A.E., Hmelnova T.F.

Журнал: Proc. 1st Scientific-Practical Workshop on Information Technologies: Algorithms, Models, Systems (ITAMS 2018)

Язык публикации: english

Серия книг: CEUR Workshop Proceedings

Том: 2221

Номера страниц: 97-111

Количество страниц: 15

Год публикации: 2018

Отчетный год: 2018

URL: http://ceur-ws.org/Vol-2221/paper15.pdf

Аннотация: When constructing a digital terrain model from the available vector data, iso-lines (relief contour lines) are used as the main source of information. Also the maps may contain the point elevation marks. To obtain the relief model, the algorithms for construction of constrained Delaunay triangulations are used, which take the contour lines as the hard edges (constraints). The algorithms may produce the artefacts – horizontal "steps consisting of triangles with all the three vertices lying on isolines of the same height. These "steps"appear, both on the ridges, and in the valleys when the neighboring isolines are located sufficiently far apart from each other. The article considers the algorithms for elimination of the horisontal triangle artefacts. The proposed algorithm is based upon adding to the triangulation the edges of the approximation of the skeleton (mid-line) of the horizontal triangle groups. To calculate the heights of the added points, a greedy algorithm is used, and we prove its optimality according to the criterion of minimizing the maximum gradient of the added edges.

Индексируется WOS: Нет

Индексируется Scopus: Нет

Индексируется УБС: Нет

Индексируется РИНЦ: Да

Индексируется ВАК: Нет

Индексируется CORE: Нет