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

We study dynamic planar point location in the External Memory Model or DiskAccess Model (DAM). Previous work in this model achieves polylog query andpolylog amortized update time. We present a data structure with $O( \log_B^2N)$ query time and $O(\frac{1}{ B^{1-\epsilon}} \log_B N)$ amortized updatetime, where $N$ is the number of segments, $B$ the block size and $\epsilon$ isa small positive constant, under the assumption that all faces have constantsize. This is a $B^{1-\epsilon}$ factor faster for updates than the fastestprevious structure, and brings the cost of insertion and deletion down tosubconstant amortized time for reasonable choices of $N$ and $B$. Our structuresolves the problem of vertical ray-shooting queries among a dynamic set ofinterior-disjoint line segments; this is well-known to solve dynamic planarpoint location for a connected subdivision of the plane with faces of constantsize.

External Memory Planar Point Location with Fast Updates