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

In the Hausdorff Voronoi diagram of a set of point-clusters in the plane, the distance between a point t and a cluster P is measured as the maximum distance between t and any point in P, and the diagram reveals the nearest cluster to t. This diagram finds direct applications in VLSI computer-aided design. In this paper, we consider "non-crossing" clusters, for which the combinatorial complexity of the diagram is linear in the total number n of points on the convex hulls of all clusters. We present a randomized incremental construction, based on point-location, to compute the diagram in expected O(n log2 n) time and expected O(n) space, which considerably improves previous results. Our technique efficiently handles non-standard characteristics of generalized Voronoi diagrams, such as sites of non-constant complexity, sites that are not enclosed in their Voronoi regions, and empty Voronoi regions. © 2014 Springer-Verlag Berlin Heidelberg.SCOPUS: cp.kinfo:eu-repo/semantics/publishe

A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters