|
Fundamentalnaya i Prikladnaya Matematika, 2023, Volume 24, Issue 3, Pages 153–169
(Mi fpm1940)
|
|
|
|
Topology-preserving triangulation simplification algorithm by edge contraction
Ya. S. Pepko, V. V. Borisenko Moscow State University, Moscow, Russia
Abstract:
Triangulation is widely used to represent models of real objects in digital form, and often, in order to get the desired model, we need to triangulate it from data of another kind, for example, from a voxel model. There are methods that allow one to do it, but the resulting triangulation does not always have the desired quality. One way to solve this problem is triangulation simplification algorithms. However, they have disadvantages; in particular, in some cases they can destroy the model topology during the simplification process, which leads to the rejection of the simplification of the tetrahedral mesh in some local area. In this paper, we will consider the naive method of triangulation simplification using edge contraction, its shortcomings, and propose its modification that allows us to contract any edges without topology violations.
Citation:
Ya. S. Pepko, V. V. Borisenko, “Topology-preserving triangulation simplification algorithm by edge contraction”, Fundam. Prikl. Mat., 24:3 (2023), 153–169; J. Math. Sci., 283:6 (2024), 929–941
Linking options:
https://www.mathnet.ru/eng/fpm1940 https://www.mathnet.ru/eng/fpm/v24/i3/p153
|
Statistics & downloads: |
Abstract page: | 13 | Full-text PDF : | 6 | References: | 3 |
|