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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Compact encodings of the connectivity of planar triangulations is a very important subject not only in graph theory but also in computer graphics. For triangle meshes used in computer graphics the topologically planar regions dominate by far. New results by Isenburg et al. [6] even show that the connectivity is sufficient to describe shape by itself. Most coding methods for planar triangulations can be extended to manifolds of bounded genus with the same upper and lower bounds on the bit rate.

Connectivity Coding: New Perspectives for Mesh Compression (Connectivity Coding: Neue Perspektiven für die Kompression von Dreiecksnetzen)