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

Accessibility analysis usually requires special models of spatial location analysis based on some geometric constructions, such asVoronoi diagram (abbreviated to VD). There are many achievements in classic Voronoi model research, however suffering from thefollowing limitations for location-based services (LBS) applications. (1) It is difficult to objectively reflect the actual service areas offacilities by using traditional planar VDs, because human activities in LBS are usually constrained only to the network portion of theplanar space. (2) Although some researchers have adopted network distance to construct VDs, their approaches are used in a staticenvironment, where unrealistic measures of shortest path distance based on assumptions about constant travel speeds through thenetwork were often used. (3) Due to the computational complexity of the shortest-path distance calculating, previous researches tendto be very time consuming, especially for large datasets and if multiple runs are required. To solve the above problems, a novelalgorithm is developed in this paper. We apply network-based quadrat system and 1-D sequential expansion to find thecorresponding subnetwork for each focus. The idea is inspired by the natural phenomenon that water flow extends along certainlinear channels until meets others or arrives at the end of route. In order to accommodate the changes in traffic conditions, the lengthof network-quadrat is set upon the traffic condition of the corresponding street. The method has the advantage over Dijkstra’salgorithm in that the time cost is avoided, and replaced with a linear time operation

the international archives of the photogrammetry, remote sensing and spatial information sciences/international archives of the photogrammetry, remote sensing and spatial information sciences

A Time-constrained Network Voronoi Construction and Accessibility Analysis in Location-based Service Technology