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

Isocontours in road networks represent the area that is reachable from asource within a given resource limit. We study the problem of computingaccurate isocontours in realistic, large-scale networks. We propose polygonswith minimum number of segments that separate reachable and unreachablecomponents of the network. Since the resulting problem is not known to besolvable in polynomial time, we introduce several heuristics that are simpleenough to be implemented in practice. A key ingredient is a new practicallinear-time algorithm for minimum-link paths in simple polygons. Experiments ina challenging realistic setting show excellent performance of our algorithms inpractice, answering queries in a few milliseconds on average even for longranges.

Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths