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

We propose the first GPU algorithm for the 3D triangulation refinementproblem. For an input of a piecewise linear complex $\mathcal{G}$ and aconstant $B$, it produces, by adding Steiner points, a constrained Delaunaytriangulation conforming to $\mathcal{G}$ and containing tetrahedra mostly ofradius-edge ratios smaller than $B$. Our implementation of the algorithm showsthat it can be an order of magnitude faster than the best CPU algorithm whileusing a similar amount of Steiner points to produce triangulations ofcomparable quality.

Computing Three-dimensional Constrained Delaunay Refinement Using the GPU