Mention space and time complexity and benchmark

[caniko]

Hello, could you mentioned the space and time complexity of your algorithm in the README.md?

I see that the Screened Poisson Surface Reconstruction mentions linear complexity; I assume it means time complexity.

How would you benchmark this? I am just curious at this point.