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 introduce an algorithm for the efficient computation of the continuousHaar transform of 2D patterns that can be described by polygons. These patternsare ubiquitous in VLSI processes where they are used to describe design andmask layouts. There, speed is of paramount importance due to the magnitude ofthe problems to be solved and hence very fast algorithms are needed. We showthat by techniques borrowed from computational geometry we are not only able tocompute the continuous Haar transform directly, but also to do it quickly. Thisis achieved by massively pruning the transform tree and thus dramaticallydecreasing the computational load when the number of vertices is small, as isthe case for VLSI layouts. We call this new algorithm the pruned continuousHaar transform. We implement this algorithm and show that for patterns found inVLSI layouts the proposed algorithm was in the worst case as fast as itsdiscrete counterpart and up to 12 times faster.

Pruned Continuous Haar Transform of 2D Polygonal Patterns with Application to VLSI Layouts