20.500.12556/DKUM-26070 A general simplification algorithm In this article a new general algorithm for triangular mesh simplification is proposed. The algorithm extends Krivograd's work from 2D to 3D. For faster execution times a hash table is used. The main idea of the algorithm is based on vertex removal approach. With this approach we remove visually less important vertices. To determine their visual importance, all vertices have tobe evaluated. This way models still preserve their essential characteristics. With simplification we can also easily present and transfer models over the network. geometric modeling triangular meshes simplification algorithms računalniška grafika geometrijsko modeliranje algoritmi poenostavljanje trikotniških mrež trikotniške mreže true false false Angleški jezik Angleški jezik Neznano 2012-05-31 11:47:43 2012-05-31 11:47:43 2022-04-15 03:40:50 2023-12-31 03:25:50 2007 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.92.021 12331542 1998-4308 URN:SI:UM:DK:KSGMWZT7 http://www.naun.org/journals/computers/ijcomputers-50.pdf 1 https://dk.um.si/Dokument.php?lang=slv&id=34997 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0