Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Could you provide a 3D point cloud example? #1

Closed
cdb0y511 opened this issue Jun 6, 2021 · 1 comment
Closed

Could you provide a 3D point cloud example? #1

cdb0y511 opened this issue Jun 6, 2021 · 1 comment
Labels
documentation Improvements or additions to documentation

Comments

@cdb0y511
Copy link

cdb0y511 commented Jun 6, 2021

Hi,@bernhard-schmitzer. Thanks for your great work.
Recently, I am looking forward to replacing the network simplex algorithm to solve OT problem. I want to pair two point clouds (x,y,z coordinates, in the euclidian distance) under OT assumptions. Then the displacement interpolation between two point clouds can be derived. So I am interested in your C++ implementation,
1.could provide an example for 3d point cloud?
2. I think the Sinkhorn kind OT may result in a dense transport plan, however, the sparse one is required (for displacement interpolation), how can I get the sparse one?
Thanks,

@bernhard-schmitzer bernhard-schmitzer added the documentation Improvements or additions to documentation label Sep 26, 2021
@bernhard-schmitzer
Copy link
Owner

Hey, just added a few more examples to the documentation that hopefully cover the questions, e.g. how to compute OT between two point clouds in 3d, and how to do some post-processing on the optimal solution. You can also have a look at the 2d displacement interpolation example. Maybe it helps. Let me know if you still have problems.
At the end of the day, the algorithm will always be a little bit fragile.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
documentation Improvements or additions to documentation
Projects
None yet
Development

No branches or pull requests

2 participants