Markus Vieth
Markus Vieth
Hi, thanks for the suggestion. PCL actually has functions to test the validity of a point (see https://github.com/PointCloudLibrary/pcl/blob/master/common/include/pcl/common/point_tests.h ). These should be used instead of using `std::isfinite` on every component,...
There is already a tutorial that shows how to estimate normals and then use `GreedyProjectionTriangulation`: https://pcl.readthedocs.io/projects/tutorials/en/master/greedy_projection.html I checked and did not find a method that computes the total area of...
> I don't see clearly how to extend it to any mesh calculated, how to test if the mesh is of triangles and if the mesh is not redundant (with...
Honestly, I still think a free function, for example called `computeTriangleMeshArea`, would be the most versatile solution, and applicable to not only GreedyProjectionTriangulation. Regarding your point that program correctness cannot/should...
We currently still aim to have PCL compatible with C++14 so that people using older compilers (which do not fully support C++17) can still use PCL. This may change in...
> why not setting a compiler option about it. There is an option to control the C++ standard used to compile PCL: https://github.com/PointCloudLibrary/pcl/blob/master/CMakeLists.txt#L11 > C++14 is 9 years old and...
> in Settings 1 above of the 2 sec, 350msec are required by the searcher_->setInputCloud that does some work in preparation That time is probably spent building the kd-tree (used...
I am not really convinced that organized vs unorganized makes such a big difference. To eliminate all other effects, you could use an organized cloud, and make that unorganized by...
@River-mao To my knowledge, nobody is working on it currently. Out of interest: what do you want to use it for? Which torus-shaped object do you want to segment with...
@cmastelaro Hi, thanks for reporting. There was a pull request recently merged on vcpkg that makes changes in exactly that part of PCL (see https://github.com/microsoft/vcpkg/pull/30996 ). So as the first...