The
cavity decomposition problem
is a computational geometry problem, arising in the context of modern electronic CAD systems, that concerns detecting the generation and propagation of electromagnetic noise into multi-layer printed circuit boards. Algorithmically speaking, the problem can be formulated so as to contain, as sub-problems, the well-known
polygon schematization
and
polygon decomposition
problems. Given a polygon
P
and a finite set
C
of given directions, polygon schematization asks for computing a
C
-oriented polygon
P
′ with “low complexity” and “high resemblance” to
P
, whereas polygon decomposition asks for partitioning
P
into a set of basic polygonal elements (e.g., triangles) whose size is as small as possible.
In this article, we present three different solutions for the cavity decomposition problem, which are obtained by suitably combining existing algorithms for polygon schematization and decomposition, by considering different input parameters, and by addressing both methodological and implementation issues. Since it is difficult to compare the three solutions on a theoretical basis, we present an extensive experimental study, employing both real-world and random data, conducted to assess their performance. We rank the proposed solutions according to the results of the experimental evaluation, and provide insights on natural candidates to be adopted, in practice, as modules of modern printed circuit board design software tools, depending on the observed performance and on the different constraints on the desired output.
Equal-area locus-based convex polygon decomposition
