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 investigate the problem of finding the visible pieces of a scene ofobjects from a specified viewpoint. In particular, we are interested in thedesign of an efficient hidden surface removal algorithm for a scene comprisedof iso-oriented rectangles. We propose an algorithm where given a set of $n$iso-oriented rectangles we report all visible surfaces in $O((n+k)\log n)$ timeand linear space, where $k$ is the number of surfaces reported. The previousbest result by Bern, has the same time complexity but uses $O(n\log n)$ space.

A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles