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

We give an algorithm that reduces the straight skeleton to the motorcyclegraph in $O(n\log n)$ time for simple polygons and $O(n(\log n)\log m)$ timefor a planar straight line graph (PSLG) with $m$ connected components. Thisimproves on the previous best of $O(n(\log n)\log r)$ for polygons with $r$reflex vertices (possibly with holes) and $O(n^2\log n)$ for general planarstraight line graphs. This allows us to speed up the straight skeletonalgorithm for polygons and PSLGs. For a polygon with $h$ holes and $r$ reflexvertices we achieve a speedup from $O(n(\log n)\log r + r^{4/3+\epsilon})$ timeto $O(n(\log n)\log h + r^{4/3 + \epsilon})$ time in the non-degenerate caseand from $O(n(\log n)\log r + r^{17/11 + \epsilon})$ to $O(n(\log n)\log h +r^{17/11 + \epsilon})$ in degenerate cases. For a PSLG with $m$ connectedcomponents and $r$ reflex vertices, we gain a speed up from $O(n^{1 + \epsilon}+ n^{8/11 + \epsilon}r^{9/11+\epsilon})$ to $O(n(\log n)\log m + r^{4/3 +\epsilon})$ in the non-degenerate case and from $O(n^{1 + \epsilon} + n^{8/11 +\epsilon}r^{9/11+\epsilon})$ to $O(n(\log n)\log m + r^{17/11 + \epsilon})$ inthe degenerate case.

Faster Reductions for Straight Skeletons to Motorcycle Graphs