Fast approximate geodesic distance on point cloud

Alexey Ruchay; Konstantin Dorofeev

doi:10.1117/12.2593887

1 August 2021 Fast approximate geodesic distance on point cloud

Alexey Ruchay, Konstantin Dorofeev

Proceedings Volume 11842, Applications of Digital Image Processing XLIV; 1184229 (2021) https://doi.org/10.1117/12.2593887
Event: SPIE Optical Engineering + Applications, 2021, San Diego, California, United States

Conference Poster

Abstract

The computation of geodesic paths and distances is a common task in many computer graphics applications, for instance obtaining 3D model measurements. Geodesic distance computation is usually performed by exact surface algorithms. However, surface reconstruction is a rather time-consuming process and does not always guarantee to get a good result in the case of missing data or cloud distortions. In this article, we propose a new fast approximate geodesic distance algorithm on the point cloud. Computer simulation results for the proposed algorithm in terms of accuracy and speed of computation are presented and discussed.

Citation Download Citation

Alexey Ruchay and Konstantin Dorofeev "Fast approximate geodesic distance on point cloud", Proc. SPIE 11842, Applications of Digital Image Processing XLIV, 1184229 (1 August 2021); https://doi.org/10.1117/12.2593887

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available