![]() The hole which is left after removal of a vertex is retriangulated with the goal of minimizing the error introduced into the mesh. The algorithm deletes vertices and surrounding triangles of the mesh which can be safely removed without violating the error constraint. ![]() We present an algorithm which drastically reduces the number of triangle mesh elements required to represent a mesh of scalar data values, while maintaining that errors at each mesh point will not exceed a user-specified bound. Often these meshes are created at a high density in order to capture the high frequency components of sampled data or to ensure an error bound in a physical simulation. Scientific applications frequently use dense scalar data defined over a 2D mesh.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |