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 Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

We present a variety of applications of certain techniques, based on partition trees, that were originally developed for range searching problems. Our results are obtained by enhancing and extending these techniques, and include: (i) An O(n4/3+δ+k)-time (for any δ>0), O(n)-space randomized algorithm for finding all k intersections of n line segments in the plane (we can count the number of these intersections in O(n4/3+δ) time and linear space). (ii) Preprocessing a collection of n (possibly intersecting) segments in the plane so that, given any query ray, we can find quickly the first segment it hits. Other applications concern “implicit” point location, hidden surface removal in three dimensions, polygon placement queries, and problems involving overlapping planar maps. We also present several efficient algorithms involving the analysis of the connectivity and other useful properties of arrangements of line segments.

Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques