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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We address the point-to-face approximate shortest path problem in R: Given aset of polyhedral obstacles with a total of n vertices, a source point s, anobstacle face f, and a real positive parameter epsilon, compute a path from sto f that avoids the interior of the obstacles and has length at most(1+epsilon) times the length of the shortest obstacle avoiding path from s tof. We present three approximation algorithms that take by extending threewell-known "point-to-point" shortest path algorithms.

Approximate Point-to-Face Shortest Paths in R^3