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/

Zendy Plus

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

Zendy Tools

Zendy Open

The input to the \emph{Triangle Evacuation} problem is a triangle $ABC$.Given a starting point $S$ on the perimeter of the triangle, a feasiblesolution to the problem consists of two unit-speed trajectories of mobileagents that eventually visit every point on the perimeter of $ABC$. The cost ofa feasible solution (evacuation cost) is defined as the supremum over allpoints $T$ of the time it takes that $T$ is visited for the first time by anagent plus the distance of $T$ to the other agent at that time.  Similar evacuation type problems are well studied in the literature coveringthe unit circle, the $\ell_p$ unit circle for $p\geq 1$, the square, and theequilateral triangle. We extend this line of research to arbitrary non-obtusetriangles. Motivated by the lack of symmetry of our search domain, we introduce4 different algorithmic problems arising by letting the starting edge and/orthe starting point $S$ on that edge to be chosen either by the algorithm or theadversary. To that end, we provide a tight analysis for the algorithm that hasbeen proved to be optimal for the previously studied search domains, as well aswe provide lower bounds for each of the problems. Both our upper and lowerbounds match and extend naturally the previously known results that wereestablished only for equilateral triangles.

Triangle Evacuation of 2 Agents in the Wireless Model