-
Notifications
You must be signed in to change notification settings - Fork 49
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
Ball-Pivoting Lifting (Point Cloud to Simplicial Complex) #55
base: main
Are you sure you want to change the base?
Conversation
Check out this pull request on See visual diffs & provide feedback on Jupyter Notebooks. Powered by ReviewNB |
Hello @nemo1120! Thank you for your submission. As we near the end of the challenge, I am collecting participant info for the purpose of selecting and announcing winners. Please email me (or have one member of your team email me) at [email protected] so I can share access to the voting form. In your email, please include:
Before July 12, make sure that your submission respects all Submission Requirements laid out on the challenge page. Any submission that fails to meet this criteria will be automatically disqualified. |
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## main #55 +/- ##
=======================================
Coverage ? 66.66%
=======================================
Files ? 18
Lines ? 537
Branches ? 0
=======================================
Hits ? 358
Misses ? 179
Partials ? 0 ☔ View full report in Codecov by Sentry. |
The ball pivoting algorithm reconstructs surfaces from oriented point cloud data sets. The algorithm works by, at initialization, selecting three points at random to form a triangle (note, all three points must fall within a ball of radius r (specified by the user), while no other points fall within the same ball). Once this triangle has been formed, a ball of radius r is rolled along the edges of the triangle. If a point falls within the this ball during its rolling (and when no other points are within the ball), a new triangle is added where the new point is a vertex in the triangle. This process is continued until all reachable edges have been tried. A new seed triangle is picked and the process is restarted until all points in the point cloud have been reached. For a more in-depth look at the algorithm, see the following reference. The images below demonstrate an example lifting on a spherical point cloud (note, this reconstruction is walked through in the tutorial ball_pivoting jupyter notebook).
[1] F. Bernardini, J. Mittleman, H. Rushmeier, C. Silva and G. Taubin, "The ball-pivoting algorithm for surface reconstruction," in IEEE Transactions on Visualization and Computer Graphics, vol. 5, no. 4, pp. 349-359, Oct.-Dec. 1999, doi: 10.1109/2945.817351.
This pull request adds the Ball-Pivoting algorithm for point cloud to simplicial complex lifting.