Results 30 issues of cDc

This library looks great! It would be exactly what I was looking fore, if it had also a way to open a file explorer window at the selected file or...

enhancement

Add support for processing scenes of any size using a divide & conquer approach: - [x] break the big SfM reconstruction into smaller chunks (sub-scenes) using some kind of clustering...

enhancement
help wanted

Traditional depth-map estimation techniques have weak support for textureless areas (ex. uniform color walls, or water surfaces) and the fusion process is affected by sky reconstruction attempts existing in the...

enhancement
help wanted

Such a cool library, unfortunately only for 2D. Can't be generalized to 3D easily?

enhancement
help wanted
question

Attempting to fill holes on a large mesh is extremely slow. At a fist look the reason seems to be the garbage collector [run ](https://github.com/pmp-library/pmp-library/blob/73425e17a972ce99c1261e122f21a30f7b8da2cb/src/pmp/algorithms/SurfaceHoleFilling.cpp#L307) 10 times for each hole,...

enhancement

For some meshes the smoothing creates vertices with NAN position. Windows 10 x64, Visual Studio Ex [mesh](https://send.firefox.com/download/ac124c789bbdf4b8/#XTuwsB88bvoJZyM62jNfsQ): ``` pmp::SurfaceSmoothing smoother(mesh); smoother.explicit_smoothing(2, false); ``` creates 8 NAN vertices: ``` invalid vertex...

enhancement

I'm using this on several platforms and all work great, but now I need it on iOS as well and something like `glob::glob("*.png")` fails with `The complexity of an attempted...

very cool addon, very helpful could you pls port it to support OpenMVS files as well? the cameras and sparse point cloud is stored in a very easy to parse...

Change-Id: I78b268a874e920084b155d85f05452021a4c4897 The `bundle_adjsuter` example takes originally a problem formulated in Snavely format. This PR extends the example to take in a problem in any format, and adds an example...

This is fast and works great for radius search. Is it also possible to implement a fast search for closest N neighbors with this octree structure?