Abstract
In order to compute approximate geodesic efficiently between two points on point cloud,a weighted graph was constructed by splitting point cloud along the Cartesian coordinate axes,thus initial approximate geodesic between any two given points could be computed out using Dijkstra's algorithm.Then the conjugate gradient method was adopted to minimize the energy function defined;finally,approximate geodesic could be obtained after some iterative steps.This proposed algorithm avoids meshing or reconstructing the point cloud to be local or global surface,and it is suitable for computing geodesic on large scale point cloud.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
