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

It is a common requirement to build a 2D map of a 3D virtual scene for path planning, but it is difficult or tedious. So we propose a multiple-level grid algorithm to solve the problem. The original idea lies in the new method on distinguishing a grid unit's accessibility. We argue for an approach by employing two navigating lines, which are right-angle intersection and stand for the unit's accessibility in four directions. Moreover, another advantage of it is to dynamically divide the virtual scene into different sizes of grids at different precisions. With these multi-precision grids, we can approach objects at any granularity. Lastly, experiments are performed to test the effectiveness of the algorithm.

Multiple-Level Grid Algorithm for Getting 2D Road Map in 3D Virtual Scene