English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Finding the geodesic path defined as the shortest paths between two points on three-dimensional surface  P  is a well known problem in differential and computational geometry. Surfaces are not differentiable in a discrete way, hence known geometry algorithms can’t be used directly - they have to be discretized first. Classic algorithms for geodesic distance calculation such as Mitchell-Mount-Papadimitriou method (MMP) are precise but slow. Therefore modern solutions are developed for fast calculations. One of them is Heat Method which approximates such paths with some accuracy. In this paper we propose the extension of Heat Method to reduce the approximation error. A new formula for calculating value of the parameter  t  (wave propagation time step) which outperforms the original one in terms of mean and median error is presented. Also, correlation between mesh properties and best wave propagation time step as well as influence of variable node spacing on heat map based method were thoroughly analysed.

Wave propagation time optimization for geodesic distances calculation using the Heat Method