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

Treemaps have been widely applied to the visualization of hierarchical data.A treemap takes a weighted tree and visualizes its leaves in a nested planargeometric shape, with sub-regions partitioned such that each sub-region has anarea proportional to the weight of its associated leaf nodes. Efficientlygenerating visually appealing treemaps that also satisfy other quality criteriais an interesting problem that has been tackled from many directions. Wepresent an optimization model and five new algorithms for this problem,including two divide and conquer approaches and three spiral treemapalgorithms. Our optimization model is able to generate superior treemaps thatcould serve as a benchmark for comparing the quality of more computationallyefficient algorithms. Our divide and conquer and spiral algorithms eitherimprove the performance of their existing counterparts with respect to aspectratio and stability or perform competitively. Our spiral algorithms also expandtheir applicability to a wider range of input scenarios. Four of thesealgorithms are computationally efficient as well with quasilinear running timesand the last algorithm achieves a cubic running time. A full version of thispaper with all appendices, data, and source codes is available at\anonymizeOSF{\OSFSupplementText}.

Space Partitioning Schemes and Algorithms for Generating Regular and Spiral Treemaps