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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We introduce a new method for finding several types of optimalk-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of theO(k) nearest neighbors to each point. We argue that this is better in a number of ways than previous algorithms, which were based on high-order Voronoi diagrams. Our technique allows us for the first time to maintain minimal sets efficiently as new points are inserted, to generalize our algorithms to higher dimensions, to find minimal convexk-vertex polygons and polytopes, and to improve many previous results. We achieve many of our results via a new algorithm for finding rectilinear nearest neighbors in the plane in timeO(n logn+kn). We also demonstrate a related technique for finding minimum areak-point sets in the plane, based on testing sets of nearest vertical neighbors to each line segment determined by a pair of points. A generalization of this technique also allows us to find minimum volume and boundary measure sets in arbitrary dimensions.

Iterated nearest neighbors and finding minimal polytopes