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

In this paper, we provide an algorithm for traversing geometric graphs whichvisits all vertices, and reports every vertex and edge exactly once. To achievethis, we combine a given geometric graph $G$ with the integer lattice, seen asa graph, in such a way that the resulting hypothetical graph can be traversedusing the algorithm in \cite{Chavez}. To overcome the problem with hypotheticalvertices and edges, we develop an algorithm for visiting any $k$th neighborhoodof a vertex in a graph straight-line drawn in the plane using $O(\log k)$memory. The memory needed to complete the traversal of a geometric graph thenturns out to depend on the maximum ratio of the graph distance and Euclideandistance for pairs of distinct vertices of $G$ at Euclidean distance greaterthan one and less than $2\sqrt{2}$.

Traversal with Enumeration of Geometric Graphs in Bounded Space