Open a5415123000 opened 3 months ago
Check out this pull request on
See visual diffs & provide feedback on Jupyter Notebooks.
Powered by ReviewNB
Attention: Patch coverage is 89.11565%
with 16 lines
in your changes missing coverage. Please review.
Please upload report for BASE (
main@497947b
). Learn more about missing BASE report.
Files | Patch % | Lines |
---|---|---|
...ansforms/liftings/graph2pointcloud/spin_lifting.py | 80.24% | 16 Missing :warning: |
:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.
Hello @a5415123000! 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 guillermo_bernardez@ucsb.edu 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.
This lifting method is based on the circular layout of graph drawing methods. Circular layout typically has problems that nodes are too densely packed and the connectivity between the nodes is not reflected in the relative positions of the nodes.
Our SpinLifting method improves on this: in breadth-first visit manner, a central point is first identified, then the neighbours of that point are placed on a circle around the point in counterclockwise order, and for each neighbouring point that has been placed, the neighbours of that point are then placed in the same way, on a circle around that point. This process is repeated until all points have been placed in the coordinate system. If a point has already been assigned coordinates, but the algorithm encounters it again, this point will be skipped (no adjustment is made to the assigned coordinates).
For details of how it works please see tutorial: spin_lifting.ipynb