We don’t allow questions seeking recommendations for software libraries, tutorials, tools, books, or other off-site resources. You can edit the question so it can be answered with facts and citations.
Closed 1 year ago.
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
接受
或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
发布评论
评论(3)
vcglib (http://www.vcglib.net ) 是一个开源 C++ 网格处理库,可提供高质量的简化。
vcglib 是 MeshLab 背后的库 (http://www.meshlab.net),因此如果您发现一些网格处理功能在 meshlab 中,您可能会在 vcglib 中找到该功能
vcglib (http://www.vcglib.net) is a open source c++ mesh processing library that offers high quality simplification.
vcglib is the library behind MeshLab (http://www.meshlab.net) so if you find some mesh processing feature in meshlab you will probably find that feature in the vcglib
以下是我找到的一些库:
1) CGAL
++ 做了很多事情;
——许可问题;
2)GTS
++开源且相当容易使用;
-- CGAL
还有什么想法吗?
Here are some libraries I found:
1) CGAL
++ Does a lot of things;
-- Licensing issues;
2) GTS
++ Open source and quite easy to use;
-- Does less that CGAL
anymore ideas?
除了其他答案中建议的库之外,我建议查看开源 MeshLib C++库,其中包含非常快速且精确的抽取函数,请参阅文档。实现的算法基于使用二次误差度量的表面简化< /a> 文章进行了多项改进和优化。
最重要的是,还有专门为如此巨大的网格定制的并行版本的网格简化。它将表面分割为较小的部分,同时抽取它们,然后再次合并它们,并抽取部分边界附近的三角形以避免任何可见的接缝,请参阅 MR::decimateParallelMesh() 函数。
In addition to the libraries suggested in other answers, I would suggest looking at open-source MeshLib C++ library, which contains very fast and precise decimation functions, see documentation. The implemented algorithm there is based on Surface Simplification Using Quadric Error Metrics article with several improvements and optimizations.
On top of that, there is a parallel version of mesh simplification specially tailored for such huge meshes. It splits the surface on smaller parts, decimates them concurrently, then merges them again, and decimates the triangles near part boundaries to avoid any visible seams, see
MR::decimateParallelMesh()
function.